A mixed constrained (identical) vehicle routing problem for time minimisation

DOI10.1007/BF03398758MaRDI QIDQ998682zbMATH OpenOpenAlexFDO

Authors J. Martínez

Publication date 9 February 2009

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf03398758

zbMATH Keywords

vehicle routing problemalphabet tablelexicographic search approachtime matrix

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Recommendations

• Publication:4889094
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• scientific article; zbMATH DE number 4047423
• Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
• Vehicle Routing with Time Windows

Cites work

• A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
• A branch and bound algorithm for the capacitated vehicle routing problem
• A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• The Loading Problem
• Two exact algorithms for the distance-constrained vehicle routing problem

Cited in

(2)

• scientific article; zbMATH DE number 1452994 (Why is no real title available?)
• Route optimization cold chain logistic distribution using greedy search method

Describes a project that uses

Uses Software

• VRP

This page was built for publication: A mixed constrained (identical) vehicle routing problem for time minimisation

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