A branch-and-price approach to the feeder network design problem

DOI10.1016/j.ejor.2017.06.063zbMath1375.90054OpenAlexW2725778773MaRDI QIDQ1681514

Christian E. M. Plum, Stefan Ropke, Alberto Santini

Publication date: 23 November 2017

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

Full work available at URL: https://backend.orbit.dtu.dk/ws/files/133956456/MELJU_1_s2.0_S0377221717306045_main.pdf

zbMATH Keywords

vehicle routing problemnetwork designliner shippingbranch and priceOR in maritime industry

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90)

Related Items (7)

Robust Team Orienteering Problem with Decreasing Profits ⋮ The transit time constrained fixed charge multi-commodity network design problem ⋮ A new formulation for the liner shipping network design problem ⋮ An economic analysis of introducing autonomous ships in a short‐sea liner shipping network ⋮ A branch-and-price algorithm for the liner shipping network design problem ⋮ Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports ⋮ A branch-and-price algorithm for solving the single-hub feeder network design problem

Uses Software

• VRP
• LINERLIB

Cites Work

• Liner shipping network design with deadlines
• Single liner shipping service design
• The pickup and delivery problem with time windows
• The traveling salesman problem with draft limits
• Exact algorithms for the traveling salesman problem with draft limits
• Methods for strategic liner shipping network design
• A service flow model for the liner shipping network design problem
• Ship routing and scheduling in the new millennium
• An exact algorithm for team orienteering problems
• Drive: Dynamic Routing of Independent Vehicles
• The Team Orienteering Pick-Up and Delivery Problem with Time Windows and its applications in fleet sizing
• Vehicle Routing
• The capacitated team orienteering and profitable tour problems
• State-space relaxation procedures for the computation of bounds to routing problems
• Shortest Path Problems with Resource Constraints

This page was built for publication: A branch-and-price approach to the feeder network design problem