Heuristic Algorithm for Single Resource Constrained Project Scheduling Problem Based on the Dynamic Programming
Ivan Stanimirović, Marko Petković, Predrag Stanimirović, Miroslav Ćirić (2009)
The Yugoslav Journal of Operations Research
Similarity:
Ivan Stanimirović, Marko Petković, Predrag Stanimirović, Miroslav Ćirić (2009)
The Yugoslav Journal of Operations Research
Similarity:
Edmund Burke, Yuri Bykov, James Newall, Sanja Petrović (2003)
The Yugoslav Journal of Operations Research
Similarity:
Ghoseiri, Keivan, Morshedsolouk, Fahimeh (2006)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Diamantidis, A.C., Papadopoulos, C.T. (2004)
Mathematical Problems in Engineering
Similarity:
Nacima Labadi, Christian Prins, Mohamed Reghioui (2008)
RAIRO - Operations Research
Similarity:
This article deals with the vehicle routing problem with time windows (VRPTW). This problem consists in determining a least-cost set of trips to serve customers during specific time windows. The proposed solution method is a memetic algorithm (MA), a genetic algorithm hybridised with a local search. Contrary to most papers on the VRPTW, which minimize first the number of vehicles, our method is also able to minimize the total distance travelled. The results on 56 classical instances...
Jozef Kratica, Dušan Tošic, Vladimir Filipović, Ivana Ljubić (2001)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms.