scientific article

François Soumis, Savelsbergh, Martin W. P., Jan Karel Lenstra, Martin Desrochers

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

vehicle routing traveling salesman approximation branch and bound routing dial-a-ride pickup and delivery set partitioning time window constraints survey of solution methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (33)

The discrete lot-sizing and scheduling problem with sequence-dependent setup costs ⋮ A parallel route building algorithm for the vehicle routing and scheduling problem with time windows ⋮ A robust strategy approach to a strategic mobility problem ⋮ A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints ⋮ The split delivery vehicle scheduling problem with time windows and grid network distances ⋮ Length-constrained cycle partition with an application to UAV routing* ⋮ The dynamic vehicle rescheduling problem ⋮ Pricing routines for vehicle routing with time windows on road networks ⋮ MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration ⋮ The vehicle routing problem with flexible time windows and traveling times ⋮ Routing problems: A bibliography ⋮ A dynamic logistics coordination model for evacuation and support in disaster response activities ⋮ A learn‐and‐construct framework for general mixed‐integer programming problems ⋮ Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems ⋮ Local search with annealing-like restarts to solve the VRPTW ⋮ Ant colony system for a VRP with multiple time windows and multiple visits ⋮ A biobjective decision model to increase security and reduce travel costs in the cash-in-transit sector ⋮ Towards a decision support system for the ready concrete distribution system: a case of a Greek company. ⋮ Dynamic Traveling Repair Problem with an Arbitrary Time Window ⋮ On the computational complexity of the probabilistic traveling salesman problem with deadlines ⋮ The pickup and delivery problem with time windows ⋮ An iterated local search algorithm for the time-dependent vehicle routing problem with time windows ⋮ Recent progress of local search in handling the time window constraints of the vehicle routing problem ⋮ Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints ⋮ Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints ⋮ Modeling and solving the fuel distribution problem with unloading precedence and loading sequence considerations ⋮ A route-neighborhood-based metaheuristic for vehicle routing problem with time windows ⋮ Practical aspects of route planning for magazine and newspaper wholesalers ⋮ The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method ⋮ Arc routing in a node routing environment ⋮ Survey of research in the design and control of automated guided vehicle systems ⋮ On compact formulations for integer programs solved by column generation ⋮ Tabu search heuristics for the vehicle routing problem with time windows.

This page was built for publication: