VRP12 (vehicle routing problem with distances one and two) with side constraints
Year of publication: |
2013
|
---|---|
Authors: | Ceranoglu, Ahmet N. ; Duman, Ekrem |
Published in: |
International journal of production economics. - Amsterdam [u.a.] : Elsevier, ISSN 0925-5273, ZDB-ID 1092526-0. - Vol. 144.2013, 2, p. 461-467
|
Subject: | Vehicle routing problem | Parallel machine scheduling | Traveling salesman problem | Cable assembly | Heuristics | Theorie | Theory | Tourenplanung | Heuristik | Rundreiseproblem | Travelling salesman problem | Scheduling-Verfahren | Scheduling problem |
-
Model of megalopolises in the tool path optimisation for CNC plate cutting machines
Čencov, Aleksandr Georgievič, (2018)
-
A coevolutionary algorithm for the flexible delivery and pickup problem with time windows
Wang, Hsiao-fan, (2013)
-
The bi-objective traveling purchaser problem with deliveries
Palomo-Martínez, Pamela J., (2019)
- More ...
-
VRP12 (vehicle routing problem with distances one and two) with side constraints
Ceranoglu, Ahmet N., (2013)
-
VRP12 (vehicle routing problem with distances one and two) with side constraints
Ceranoglu, Ahmet N., (2013)
-
Duman, Ekrem, (2017)
- More ...