The vehicle routing problem: An overview of exact and approximate algorithms

From MaRDI portal
Publication:1198313


DOI10.1016/0377-2217(92)90192-CzbMath0761.90034WikidataQ115188680 ScholiaQ115188680MaRDI QIDQ1198313

Gilbert Laporte

Publication date: 16 January 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)


90B06: Transportation, logistics and supply chain management

90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming

90-08: Computational methods for problems pertaining to operations research and mathematical programming


Related Items

Algorithms for the Vehicle Routing Problems with Time Deadlines, A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions, On-Line Vehicle Routing and Scheduling With Time-Varying Travel Speeds, Heuristics from Nature for Hard Combinatorial Optimization Problems, Branch and cut methods for network optimization, A tabu search method for the truck and trailer routing problem, Models, relaxations and exact approaches for the capacitated vehicle routing problem, A tabu search algorithm for the open vehicle routing problem, The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times, The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations, A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows, Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems, Synchronized routing of seasonal products through a production/distribution network, The traveling salesman problem: An overview of exact and approximate algorithms, Practical aspects of route planning for magazine and newspaper wholesalers, Stochastic vehicle routing, A heuristic algorithm for the asymmetric capacitated vehicle routing problem, Planning models for freight transportation, A multi-level composite heuristic for the multi-depot vehicle fleet mix problem, The many-to-many location-routing problem, Combined location-routing problems: A synthesis and future research directions, Vehicle routing with split deliveries, A robust strategy approach to a strategic mobility problem, An adaptive memory heuristic for a class of vehicle routing problems with minmax objective, Modeling rolling batch planning as vehicle routing problem with time windows., Design of an IT-driven decision support system for vehicle routing and scheduling., Resource planning and a depot location model for electric power restoration., Planning models for long-haul operations of postal and express shipment companies, A real delivery problem dealt with Monte Carlo techniques, The periodic vehicle routing problem with intermediate facilities, Relaxed tours and path ejections for the traveling salesman problem, A cooperative parallel meta-heuristic for the vehicle routing problem with time windows, Extensions to the generalised assignment heuristic for vehicle routing, A sweep-based algorithm for the fleet size and mix vehicle routing problem, A visual interactive approach to vehicle routing, A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem, A genetic algorithm for the vehicle routing problem, Routing problems: A bibliography, The simulated trading heuristic for solving vehicle routing problems, A tabu search heuristic for the multi-depot vehicle routing problem, Integrated shipment dispatching and packing problems: a case study, A queueing framework for routing problems with time-dependent travel times, Vehicle routing with dynamic travel times: a queueing approach, Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots, Single vehicle routing with a predefined customer sequence and multiple depot returns, A survey of scheduling problems with setup times or costs, Evaluation of a USMC combat service support logistics concept, Formulations and valid inequalities for the heterogeneous vehicle routing problem, Fuzzy vehicle routing model with credibility measure and its hybrid intelligent algorithm, A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows, Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem, Heuristic approaches to vehicle routing with backhauls and time windows, Survey of research in the design and control of automated guided vehicle systems, Scheduling of road vehicles in sugarcane transport: a case study at an Australian sugar mill, A Neural-Network-Based Approach to the Double Traveling Salesman Problem, A Javatm universal vehicle router for routing unmanned aerial vehicles, A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows, Vehicle routing with stochastic demands and restricted failures


Uses Software


Cites Work