A new two-stage heuristic for the recreational vehicle scheduling problem
Year of publication: |
March 2018
|
---|---|
Authors: | Kulkarni, Sarang ; Patil, Rahul ; Krishnamoorthy, Mohan ; Ernst, Andreas ; Ranade, Abhiram |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 91.2018, p. 59-78
|
Subject: | Recreational vehicle scheduling | Heuristic | Integer programming | Mathematical formulation | Assignment problem | Network flow | Inventory | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Tourenplanung | Vehicle routing problem | Ganzzahlige Optimierung | Mathematische Optimierung | Mathematical programming | Tourismusregion | Tourism destination |
-
Upper and lower bounding procedures for the multiple knapsack assignment problem
Kataoka, Seiji, (2014)
-
The in-house logistics routing problem
Fabri, Marcelus, (2023)
-
A fill-and-reduce greedy algorithm for the container pre-marshalling problem
Araya, Ignacio, (2023)
- More ...
-
The capacitated multiple allocation hub location problem: Formulations and algorithms
Ebery, Jamie, (2000)
-
Exact Solutions to Task Allocation Problems
Ernst, Andreas, (2006)
-
Exact Solutions to Task Allocation Problems
Ernst, Andreas, (2006)
- More ...