Heuristic algorithms for visiting the customers in a rolling schedule environment

DOI10.1007/S00291-005-0002-7zbMATH Open1101.90088OpenAlexW2004480519MaRDI QIDQ850656FDOQ850656

Huei-Chuen Huang, Suyan Teng, Hoon Liong Ong

Publication date: 3 November 2006

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

Full work available at URL: https://doi.org/10.1007/s00291-005-0002-7

Recommendations

• Scheduling policies for multi-period services
• A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design
• Heuristics to Schedule Service Engineers within Time Windows
• A heuristic method for dispatching repair men
• Scheduling periodic customer visits for a traveling salesperson

zbMATH Keywords

Column generationHeuristicRolling scheduleSet packingOrienteering problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

• A Linear Programming Approach to the Cutting-Stock Problem
• The orienteering problem
• A method for the cutting stock problem with different qualities
• GRASP for set packing problems.
• An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
• Combinatorial auctions: a survey
• Title not available (Why is that?)
• Routing Trains Through Railway Stations: Model Formulation and Algorithms
• A set packing model for the ground holding problem in congested networks
• The team orienteering problem
• Title not available (Why is that?)
• A fast and effective heuristic for the orienteering problem
• DRIVE: Dynamic routing of independent vehicles
• Title not available (Why is that?)
• An Optimal Algorithm for the Orienteering Tour Problem
• Solving the Orienteering Problem through Branch-and-Cut
• A TABU search heuristic for the team orienteering problem
• Title not available (Why is that?)
• Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
• Combinatorial optimization. Theory and algorithms
• Modeling and algorithmic development of a staff scheduling problem
• An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint

This page was built for publication: Heuristic algorithms for visiting the customers in a rolling schedule environment

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