A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints

DOI10.1007/BF01720353zbMath0757.90020MaRDI QIDQ1198141

A. Metz, Ulrich Derigs

Publication date: 16 January 1993

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

approximate solutionsmatchingvehicle routingnon-smooth optimizationset partitioningtime window constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A two-phase algorithm for the partial accessibility constrained vehicle routing problem, Routing problems: A bibliography, MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems, Unnamed Item, A genetic-based framework for solving (multi-criteria) weighted matching problems.

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization with nonsmooth data
• Matching problems with generalized upper bound side constraints
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Optimal set partitioning, matchings and lagrangian duality
• A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems