Results 91 to 100 of about 12,651,596 (195)

An adaptive large neighborhood search heuristic for the green dial‐a‐ride problem

, 2019
This chapter presents a new extension of the Dial‐a‐Ride Problem (DARP), in which a fleet of Alternative Fuel Vehicles (AFVs) is considered. Due to the limited driving range, the AFVs may visit some Alternative Fuel Stations to be refueled with a partial
Manar Hosny, Emrah Demir, Hosny, Manar, Demir, Emrah, Mohamed Amine Masmoudi, Masmoudi, Mohamed Amine   +5 more
core   +1 more source

Reinforcement Learning-Enhanced Operator Selection in Adaptive Large Neighborhood Search: Application to CVRP and VRPTW

International audienceReinforcement Learning-Enhanced Operator Selection in Adaptive Large Neighborhood Search: Application to CVRP and ...
Ramdane Cherif-Khettaf, Wahiba, Cherrered, Asma, Oulamara, Ammar   +2 more
core   +1 more source

An Adaptive Large Neighborhood Search Algorithm for Equipment Scheduling in the Railway Yard of an Automated Container Terminal

Journal of Marine Science and Engineering
In container sea–rail combined transport, the railway yard in an automated container terminal (RYACT) is the link in the whole logistics transportation process, and its operation and scheduling efficiency directly affect the efficiency of logistics.
Hongbin Chen, Wei Liu
doaj   +1 more source

Bus station-skip scheduling problem with passenger infection risk

Digital Transportation and Safety
The present research offers optimized strategies for bus scheduling that take into account the risk perceptions of infectious diseases in the post-pandemic era.
Liang Zhong, Peng Sun, Gladkova Vasilina, Li Wang, Liyang Xiao   +4 more
doaj   +1 more source

Self-adaptive cuckoo search algorithm for hybrid flowshop makespan problem

, 2015
As a typical NP-hard combination optimization problem, the hybrid flow shop widely exists in manufacturing systems. In this paper, a mathematical model of hybrid flow shop is formulated, and then a new encoding and decoding method based on matrix is ...
Han Zhonghua, Han ZH(韩忠华), Lv Xisheng, Dong Xiaoting, Lv XS(吕希胜), Dong XT(董晓婷)   +5 more
core   +1 more source

A Robust Competitive Global Supply Chain Network Design under Disruption: The Case of Medical Device Industry

International Journal of Industrial Engineering and Production Research, 2015
In this study, an optimization model is proposed to design a Global Supply Chain (GSC) for a medical device manufacturer under disruption in the presence of pre-existing competitors and price inelasticity of demand.
Aliakbar Hasani, Seyed Hessameddin Zegordi   +1 more
doaj  

Two-stage iterative data transmission scheduling algorithm for satellite Internet integrating communication and remote sensing

Tongxin xuebao
Aiming at the data transmission scheduling problem in the satellite Internet integrating communication and remote sensing (SatInternet-CR), a mathematical model with the goal of maximizing data transmission profits was established subject to constraints ...
LI Hai, LI Yongjun, ZHANG Taijiang, LI Yu, ZHAO Shanghong, WANG Jie, HAN Yue   +6 more
doaj  

Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems [PDF]

The generalized minimum spanning tree problem is a generalization of the minimum spanning tree problem. This network design problems finds several practical applications, especially when one considers the design of a large-capacity backbone network ...
Ghosh, Diptesh
core  

MNATS: A Multi-Neighborhood Adaptive Tabu Search Algorithm for the Distributed No-Wait Flow Shop Scheduling Problem

The Distributed No-Wait Flow Shop Scheduling Problem (DNWFSP) arises in various manufacturing contexts, such as chemical production and electronic assembly, where strict no-wait constraints and multi-factory coordination are required.
Hong Zhao, Wanqiu Zhao, Xu Bian, Zhaohui Zhang   +3 more
core   +1 more source

Adaptive Large Neighbourhood Search

, 2010
Large neighborhood search is a metaheuristic that has gained popularity in recent years. The heuristic repeatedly moves from solution to solution by first partially destroying the solution and then repairing it.
Røpke, Stefan
core