The shared customer collaboration vehicle routing problem

DOI10.1016/j.ejor.2017.08.051zbMath1374.90046OpenAlexW2752225574MaRDI QIDQ1681166

Peng Zhang

Publication date: 23 November 2017

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/114847

zbMATH Keywords

branch-and-cut algorithmmixed integer programmingvehicle routing problemurban logisticscarriers collaboration

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (9)

Shared capacity routing problem -- an omni-channel retail study ⋮ Collaborative urban transportation: recent advances in theory and practice ⋮ Carrier collaboration with the simultaneous presence of transferable and non-transferable utilities ⋮ Sequential versus integrated optimization: production, location, inventory control, and distribution ⋮ When and how to share first-mile parcel collection service ⋮ Collaborative transportation with overlapping coalitions ⋮ The collaborative consistent vehicle routing problem with workload balance ⋮ On carriers collaboration in hub location problems ⋮ Shared resources in collaborative vehicle routing

Cites Work

• Unnamed Item
• Unnamed Item
• Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
• The selective vehicle routing problem in a collaborative environment
• Multi-period vehicle routing problem with due dates
• On the collaboration uncapacitated arc routing problem
• Shipper collaboration
• A result on projection for the vehicle routing problem
• The flexible periodic vehicle routing problem
• Cooperative game theory approach to allocating benefits of horizontal cooperation
• Collaborative transportation planning of less-than-truckload freight
• Collaborating freight forwarding enterprises
• Vehicle Routing
• Network Design and Allocation Mechanisms for Carrier Alliances in Liner Shipping
• Horizontal cooperation among freight carriers: request allocation and profit sharing
• Resource Pooling and Cost Allocation Among Independent Service Providers
• Implementing vehicle routing algorithms
• A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Formulations for an inventory routing problem
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem

This page was built for publication: The shared customer collaboration vehicle routing problem