A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design

DOI10.1016/j.ejor.2018.01.047zbMath1431.90063OpenAlexW2791842797MaRDI QIDQ1744533

Martin Pouls, Jörg Kalcsics, Stefan Nickel, Matthias Bender

Publication date: 23 April 2018

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

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/52923269/Bender_et_al_Branch_and_Price_Algorithm_for_Visit_Scheduling_003_.pdf

zbMATH Keywords

transportationbranch-and-priceacceleration techniquesmulti-period service territory designscheduling of customer visits

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items

Towards a stochastic programming modeling framework for districting ⋮ Approximation schemes for districting problems with probabilistic constraints ⋮ Territorial design for customers with demand frequency

Cites Work

• Unnamed Item
• Branching rules revisited
• Column generation based heuristic for tactical planning in multi-period vehicle routing
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Drive: Dynamic Routing of Independent Vehicles
• An Optimization Based Heuristic for Political Districting
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• A Computational Study of Search Strategies for Mixed Integer Programming
• On the facial structure of set packing polyhedra
• Selected Topics in Column Generation
• A Primer in Column Generation