Keyword: vehicle routing & scheduling

Found 1030 papers in total
Linear time dynamic-programming algorithms for new classes of retricted traveling salesman problems: A computational study
Linear time dynamic-programming algorithms for new classes of retricted traveling salesman problems: A computational study
2001,
Consider the following restricted (symmetric or asymmetric) traveling-salesman problem...
The online traveling salesman problem against fair adversaries
The online traveling salesman problem against fair adversaries
2001,
In the online traveling saleman problem, requests for visits to cities (points in a...
Dynamic capacitated user-optimal departure time/route choice problem with time-window
Dynamic capacitated user-optimal departure time/route choice problem with time-window
2001,
A discrete-time predictive dynamic user-optimal departure time/route choice problem...
A mean-variance model for route guidance in advanced traveler information systems
A mean-variance model for route guidance in advanced traveler information systems
2001,
Traditional models of route generation are based on choosing routes that minimize...
Using a weight-assessing model to identify route choice criteria and information effects
Using a weight-assessing model to identify route choice criteria and information effects
2001,
Shortest-path (minimum travel time) routing has been adopted over the past few...
Algorithms for the weight constrained shortest path problem
Algorithms for the weight constrained shortest path problem
2001,
Given a directed graph whose arcs have an associated cost, and associated weight, the...
The dynamic and stochastic knapsack problem with random sized items
The dynamic and stochastic knapsack problem with random sized items
2001,
A resource allocation problem, called the dynamic and stochastic knapsack problem...
Dynamic routing of unmanned aerial vehicles using reactive tabu search
Dynamic routing of unmanned aerial vehicles using reactive tabu search
2001,
Unmanned Aerial Vehicle (UAV) routing is a complex problem faced by the operators of...
Optimal routing in an automated storage/retrieval system with dedicated storage
Optimal routing in an automated storage/retrieval system with dedicated storage
1999,
We address the sequencing of requests in an automated storage/retrieval system with...
Fleet management models and algorithms for an oil-tanker routing and scheduling problem
Fleet management models and algorithms for an oil-tanker routing and scheduling problem
1999,
This paper explores models and algorithms for routing and scheduling ships in a...
The laser-plotter beam routing problem
The laser-plotter beam routing problem
2001,
Laser-plotters are used in the manufacturing industry to draw trademarks and...
The uncapacitated facility location problem with client matching
The uncapacitated facility location problem with client matching
2000,
The Uncapacitated Facility Location Problem with Client Matching (LCM) is an extension...
The dynamic transshipment problem
The dynamic transshipment problem
2001,
We investigate the strategy of transshipments in a dynamic deterministic demand...
Airline fleet assignment with time windows
Airline fleet assignment with time windows
2000,
Recognizing that allowing variability in scheduled flight departure times can result...
Improving the quality of operations in truckload trucking
Improving the quality of operations in truckload trucking
2000,
In this paper, the authors discuss the quality of operations in the truckload trucking...
Adaptive labeling algorithms for the dynamic assignment problem
Adaptive labeling algorithms for the dynamic assignment problem
2000,
We consider the problem of dynamically routing a driver to cover a sequence of tasks...
A look-ahead routing procedure for machine selection in a highly informative manufacturing system
A look-ahead routing procedure for machine selection in a highly informative manufacturing system
2001,
Many dispatching rules have been developed for the on-line control of product flow in...
Routing methods for warehouses with multiple cross aisles
Routing methods for warehouses with multiple cross aisles
2001,
This paper considers routing and layout issues for parallel aisle warehouses. In such...
A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem
A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem
2000,
This paper introduces a network design problem with a structure that is encountered in...
Some optimum mathematical models in a postal transport network
Some optimum mathematical models in a postal transport network
2000,
The paper presents some optimum mathematical models for dispatching vehicles in a...
Using a multi-agent approach to optimise the train coupling and sharing system
Using a multi-agent approach to optimise the train coupling and sharing system
2001,
This paper discusses a multi-agent scheduling system using the example of the railway...
Ship scheduling with soft time windows: An optimisation based approach
Ship scheduling with soft time windows: An optimisation based approach
2001,
This paper considers a real ship scheduling problem that can be considered as a...
Vulnerability of scheduled networks and a generalization of Menger's theorem
Vulnerability of scheduled networks and a generalization of Menger's theorem
1996,
An edge-scheduled network N is a multigraph G = ( V, E ), where each edge e ∈ E...
Parallel integer optimization for crew scheduling
Parallel integer optimization for crew scheduling
2000,
Performance aspects of a Lagrangian relaxation based heuristic for solving large...
Papers per page: