|
|
|
|
|
Min Tang, Bin Ji, Xiaoping Fang and Samson S. Yu
The continuous berth allocation and quay crane assignment problem considers the size of berths and ships, the number of quay cranes, the dynamic ships and non-crossing constraints of quay cranes. In this work, a mixed-integer linear programming model of ...
ver más
|
|
|
|
|
|
|
|
|
Daniela Ambrosino, Carmine Cerrone and Anna Sciomachen
This paper presents a new heuristic algorithm tailored to solve large instances of an NP-hard variant of the shortest path problem, denoted the cost-balanced path problem, recently proposed in the literature. The problem consists in finding the origin?de...
ver más
|
|
|
|
|
|
|
|
|
Shaolong Yang, Jin Huang, Weichao Li and Xianbo Xiang
A growing number of researchers are interested in deploying unmanned surface vehicles (USVs) in support of ocean environmental monitoring. To accomplish these missions efficiently, multiple-waypoint path planning strategies for survey USVs are still a ke...
ver más
|
|
|
|
|
|
|
|
|
Mehrdad Amirghasemi
This paper presents an effective stochastic algorithm that embeds a large neighborhood decomposition technique into a variable neighborhood search for solving the permutation flow-shop scheduling problem. The algorithm first constructs a permutation as a...
ver más
|
|
|
|
|
|
|
|
|
Narisara Khamsing, Kantimarn Chindaprasert, Rapeepan Pitakaso, Worapot Sirirak and Chalermchat Theeraviriya
This research presents a solution to the family tourism route problem by considering daily time windows. To find the best solution for travel routing, the modified adaptive large neighborhood search (MALNS) method, using the four destructions and the fou...
ver más
|
|
|
|