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

DOI10.1007/BF03398758zbMath1153.90326OpenAlexW2777191520MaRDI QIDQ998682

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

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

Related Items (1)

Route optimization cold chain logistic distribution using greedy search method

Uses Software

• VRP

Cites Work

• 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
• Two exact algorithms for the distance-constrained vehicle routing problem
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
• The Loading Problem

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