Heuristic algorithms for visiting the customers in a rolling schedule environment

DOI10.1007/s00291-005-0002-7zbMath1101.90088OpenAlexW2004480519MaRDI QIDQ850656

Hoon Liong Ong, Huei-Chuen Huang, Suyan Teng

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

zbMATH Keywords

Column generationRolling scheduleHeuristicSet packingOrienteering problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
• The team orienteering problem
• A fast and effective heuristic for the orienteering problem
• A method for the cutting stock problem with different qualities
• GRASP for set packing problems.
• A TABU search heuristic for the team orienteering problem
• Drive: Dynamic Routing of Independent Vehicles
• An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
• Combinatorial Auctions: A Survey
• A Linear Programming Approach to the Cutting-Stock Problem
• The orienteering problem
• An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
• An Optimal Algorithm for the Orienteering Tour Problem
• Routing Trains Through Railway Stations: Model Formulation and Algorithms
• Solving the Orienteering Problem through Branch-and-Cut
• Combinatorial optimization. Theory and algorithms
• Modeling and algorithmic development of a staff scheduling problem
• A set packing model for the ground holding problem in congested networks

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