scientific article; zbMATH DE number 52971

MaRDI QIDQ4003232zbMATH OpenFDO

Authors Martin W. P. Savelsbergh

Publication date 23 January 1993

zbMATH Keywords

approximation algorithmsdial-a-ridedistribution managementexpert systemgraphical interfaceheuristicsinteractive planningmultiple traveling salesmanpick and deliveryreal life situationsschedulingtime windowsvehicle routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Applications of mathematical programming (90C90)

Recommendations

• scientific article; zbMATH DE number 3984951
• A visual interactive approach to vehicle routing
• Microcomputer-based vehicle routing and scheduling software
• ALTO: A computer system for the design of vehicle routing algorithms
• A decision support system for a real vehicle routing problem.

Cited in

(18)

• ALTO: A computer system for the design of vehicle routing algorithms
• A heuristic algorithm for the asymmetric capacitated vehicle routing problem
• A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
• Improvement heuristics for the vehicle routing problem based on simulated annealing
• Sequential and parallel local search for the time-constrained traveling salesman problem
• Microcomputer-based vehicle routing and scheduling software
• A guided local search heuristic for the capacitated arc routing problem
• Robust vehicle routing DSS and road networks on a European scale?
• An interactive decision support system for the bank courier routing problem
• A computer assistant for vehicle dispatching with learning capabilities
• Routing problems: A bibliography
• Real-life vehicle routing with time windows for visual attractiveness and operational robustness
• scientific article; zbMATH DE number 3896662 (Why is no real title available?)
• scientific article; zbMATH DE number 3984951 (Why is no real title available?)
• Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem
• Comparing descent heuristics and metaheuristics for the vehicle routing problem
• An efficient implementation of local search algorithms for constrained routing problems
• On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4003232)