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.047MaRDI QIDQ1744533zbMATH OpenOpenAlexFDO

Authors Matthias Bender, Jörg Kalcsics, S. Nickel, Martin Pouls

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

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

Recommendations

• Multi-period service territory design
• A branch-and-price algorithm for the aperiodic multi-period service scheduling problem
• Branch-and-price for a multi-attribute technician routing and scheduling problem
• Scheduling policies for multi-period services
• A branch-and-price algorithm for the long-term home care scheduling problem

Cites work

• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• A Computational Study of Search Strategies for Mixed Integer Programming
• A Primer in Column Generation
• Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems
• An optimization based heuristic for political districting
• Branch-and-price: Column generation for solving huge integer programs
• Branching rules revisited
• Column generation based heuristic for tactical planning in multi-period vehicle routing
• DRIVE: Dynamic routing of independent vehicles
• On the facial structure of set packing polyhedra
• Selected Topics in Column Generation
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows

Cited in

(10)

• Towards a stochastic programming modeling framework for districting
• Heuristic algorithms for visiting the customers in a rolling schedule environment
• The customer assignment and traveling salespersons problem
• A branch-and-price algorithm for the long-term home care scheduling problem
• Scheduling policies for multi-period services
• Territorial design for customers with demand frequency
• Scheduling periodic customer visits for a traveling salesperson
• Approximation schemes for districting problems with probabilistic constraints
• A branch-and-price algorithm for the aperiodic multi-period service scheduling problem
• Multi-period service territory design

This page was built for publication: A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744533)