|
|
|
|
|
Shichang Xiao, Jinshan Huang, Hongtao Hu and Yuxin Gu
Automatic guided vehicles (AGVs) in the horizontal area play a crucial role in determining the operational efficiency of automated container terminals (ACTs). To improve the operational efficiency of an ACT, it is essential to decrease the impact of batt...
ver más
|
|
|
|
|
|
|
|
|
|
|
Antonella Nardin and Fabio D?Andreagiovanni
Electric scooter sharing mobility services have recently spread in major cities all around the world. However, the bad parking behavior of users has become a major source of issues, provoking accidents and compromising urban decorum of public areas. Redu...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jiaming Su, Minghua Hu, Yingli Liu and Jianan Yin
|
|
|
|
|
|
|
|
|
|
|
Nasser Lotfi and Mazyar Ghadiri Nejad
Multi-objective task graph scheduling is a well-known NP-hard problem that plays a significant role in heterogeneous distributed systems. The solution to the problem is expected to optimize all scheduling objectives. Pretty large state-of-the-art algorit...
ver más
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Abdelraouf Ishtaiwi, Feda Alshahwan, Naser Jamal, Wael Hadi and Muhammad AbuArqoub
For decades, the use of weights has proven its superior ability to improve dynamic local search weighting algorithms? overall performance. This paper proposes a new mechanism where the initial clause?s weights are dynamically allocated based on the probl...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sadik Ozgur Degertekin, Mohammad Minooei, Lorenzo Santoro, Bartolomeo Trentadue and Luciano Lamberti
Metaheuristic algorithms currently represent the standard approach to engineering optimization. A very challenging field is large-scale structural optimization, entailing hundreds of design variables and thousands of nonlinear constraints on element stre...
ver más
|
|
|
|
|
|