On the Distance Constrained Vehicle Routing Problem

DOI10.1287/OPRE.40.4.790zbMATH Open0758.90028OpenAlexW2135201914MaRDI QIDQ4022935FDOQ4022935

Authors: Chung-Lun Li, David Simchi-Levi, Martin Desrochers 

Publication date: 17 January 1993

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.40.4.790

Recommendations

• On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
• Two exact algorithms for the distance-constrained vehicle routing problem
• Approximation algorithms for some vehicle routing problems
• Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
• scientific article; zbMATH DE number 4066603

zbMATH Keywords

heuristicsvehicle routingworst case analysis

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06)

Cited In (36)

• Approximation algorithms for distance constrained vehicle routing problems
• An overview of graph covering and partitioning
• Title not available (Why is that?)
• Distance measures and fitness-distance analysis for the capacitated vehicle routing problem
• Total distance approximations for routing solutions
• Sequential search and its application to vehicle-routing problems
• Using global search heuristics for the capacity vehicle routing problem.
• A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation
• A genetic algorithm for service level based vehicle scheduling
• Two exact algorithms for the distance-constrained vehicle routing problem
• Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints
• Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
• Green hybrid fleets using electric vehicles: solving the heterogeneous vehicle routing problem with multiple driving ranges and loading capacities
• The \(k\)-dissimilar vehicle routing problem
• Approximation algorithms for some vehicle routing problems
• Computational Science – ICCS 2005
• Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity
• A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times
• A single machine scheduling problem with availability constraints and sequence-dependent setup costs
• Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics
• The close-open mixed vehicle routing problem
• Set covering in fuel-considered vehicle routing problems
• Approximation algorithms for distance constraint sweep coverage with base stations
• The directed orienteering problem
• Routing problems: A bibliography
• Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints
• Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
• The bi-objective \(k\)-dissimilar vehicle routing problem
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
• A parametric analysis of heuristics for the vehicle routing problem with side-constraints
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
• Distance constrained vehicle routing problem to minimize the total cost
• Vehicle Routing Problems with Inter-Tour Resource Constraints
• The school bus problem on trees
• On a Labeled Vehicle Routing Problem
• Iterated tour partitioning for Euclidean capacitated vehicle routing

This page was built for publication: On the Distance Constrained Vehicle Routing Problem

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