A multiobjective optimizer with a K-means cluster algorithm for a distributed flexible flowshop rescheduling problem DOI
Xin-Rui Tao,

Quan-Ke Pan,

Hongyan Sang

et al.

Applied Soft Computing, Journal Year: 2024, Volume and Issue: 166, P. 112124 - 112124

Published: Aug. 14, 2024

Language: Английский

Heuristic approaches to address vehicle routing problem in the Iot-based waste management system DOI
Golman Rahmanifar, Mostafa Mohammadi,

Ali Sherafat

et al.

Expert Systems with Applications, Journal Year: 2023, Volume and Issue: 220, P. 119708 - 119708

Published: Feb. 16, 2023

Language: Английский

Citations

57

The two-echelon truck-unmanned ground vehicle routing problem with time-dependent travel times DOI

Yuanhan Wei,

Yong Wang, Xiangpei Hu

et al.

Transportation Research Part E Logistics and Transportation Review, Journal Year: 2025, Volume and Issue: 194, P. 103954 - 103954

Published: Jan. 8, 2025

Language: Английский

Citations

3

Collaboration and Resource Sharing for the Multi-Depot Electric Vehicle Routing Problem with Time Windows and Dynamic Customer Demands DOI Open Access
Yong Wang, Can Chen,

Yuanhan Wei

et al.

Sustainability, Journal Year: 2025, Volume and Issue: 17(6), P. 2700 - 2700

Published: March 18, 2025

With increasingly diverse customer demands and the rapid growth of new energy logistics industry, establishing a sustainable responsive network is critical. In multi-depot network, adopting collaborative distribution resource sharing can significantly improve operational efficiency. This study proposes collaboration for electric vehicle (EV) routing problem with time windows dynamic demands. A bi-objective optimization model formulated to minimize total operating costs number EVs. To solve model, novel hybrid algorithm combining mini-batch k-means clustering an improved multi-objective differential evolutionary (IMODE) proposed. integrates genetic operations non-dominated sorting operation enhance solution quality. The strategies dynamically inserting charging stations are embedded within identify Pareto-optimal solutions effectively. algorithm’s efficacy applicability verified through comparisons algorithm, particle swarm ant colony optimization, tabu search. Additionally, case company in Chongqing City, China demonstrates that proposed method reduces improves Sensitivity analysis considering different demand response modes provides insights reducing enhancing findings offer essential promoting environmentally resource-efficient city.

Language: Английский

Citations

1

Scheduling Emergency Materials Using Road-Network Repair Time Sequence DOI
Jiao Zhao, Chaofeng Chen, Hui Hu

et al.

Transportation Research Record Journal of the Transportation Research Board, Journal Year: 2025, Volume and Issue: unknown

Published: April 24, 2025

Natural disasters, such as earthquakes, can cause significant damage to road networks, leading reduced rescue efficiency and hindrance operations. This study focuses on the time-sequence repair strategy for damaged network optimize material scheduling efforts. The disaster time is divided into multiple cycles, considering quantitative impact of passage time. A dynamic decision-making model formulated simultaneously. To tackle complexity model, a combination genetic algorithm Benders decomposition employed solving. effectiveness proposed evaluated using case based Ya’an earthquake. solution compared with performance mixed-integer programming solvers DICOPT (discrete continuous optimizer) SBB (simple branch bound) GAMS software. results indicate that achieves an average gap rate 2.4% when solving problem objective weighted sum transport volume urgent materials. Furthermore, dealing time, materials, out-of-stock rate, fail find acceptable solutions within reasonable frames. demonstrates efficacy in addressing emergency-material-scheduling problems efficiently.

Language: Английский

Citations

1

MOEA/D with customized replacement neighborhood and dynamic resource allocation for solving 3L-SDHVRP DOI
H. Li, Genghui Li, Qiaoyong Jiang

et al.

Swarm and Evolutionary Computation, Journal Year: 2024, Volume and Issue: 85, P. 101463 - 101463

Published: Jan. 9, 2024

Language: Английский

Citations

6

Optimization of Truck–Cargo Online Matching for the Less-Than-Truck-Load Logistics Hub under Real-Time Demand DOI Creative Commons

Tang Weilin,

Xinghan Chen, Maoxiang Lang

et al.

Mathematics, Journal Year: 2024, Volume and Issue: 12(5), P. 755 - 755

Published: March 2, 2024

Reasonable matching of capacity resources and transported cargoes is the key to realizing intelligent scheduling less-than-truck-load (LTL) logistics. In practice, there are many types numbers participating objects involved in LTL logistics, such as customers, orders, trucks, unitized implements, etc. This results a complex large number schemes where truck assignments interact with customer order service sequencing. For truck–cargo online problem under real-time demand, it necessary comprehensively consider process multi-node orders multi-types trucks. Combined actual operation scenario, mixed-integer nonlinear programming model introduced, an algorithm double-layer nested time window designed solve it. By solving small numerical case using Gurobi algorithm, validity effectiveness verified. The indicate that can obtain optimization lower gap while outperforming terms computation time. Relying on realistic large-scale for empirical analysis, significant reduction trips smaller average loading efficiency has reached close 95%. experimental demonstrate general applicability algorithm. Thus, helps realize on-demand allocation timely response transportation logistics hubs.

Language: Английский

Citations

6

A co-evolutionary genetic algorithm with knowledge transfer for multi-objective capacitated vehicle routing problems DOI
Chao Wang, Biao Ma,

Jiye Sun

et al.

Applied Soft Computing, Journal Year: 2023, Volume and Issue: 148, P. 110913 - 110913

Published: Oct. 12, 2023

Language: Английский

Citations

11

The multi-compartment truck and trailer petrol station replenishment problem with domino hazard risks DOI
Weitiao Wu, Yu Li

Transportation Research Part B Methodological, Journal Year: 2024, Volume and Issue: 190, P. 103078 - 103078

Published: Oct. 4, 2024

Language: Английский

Citations

4

Evolutionary multitasking for bidirectional adaptive codec: A case study on vehicle routing problem with time windows DOI
Yanlin Wu,

Yanguang Cai,

Chuncheng Fang

et al.

Applied Soft Computing, Journal Year: 2023, Volume and Issue: 145, P. 110605 - 110605

Published: July 8, 2023

Language: Английский

Citations

11

Logistics Distribution Vehicle Routing Problem with Time Window under Pallet 3D Loading Constraint DOI Open Access
Yong Liu, Zhicheng Yue, Yong Wang

et al.

Sustainability, Journal Year: 2023, Volume and Issue: 15(4), P. 3594 - 3594

Published: Feb. 15, 2023

As an important support of the e-commerce industry, express delivery industry is particularly in national development. Low loading rates caused by numerous types containers and cost increases low unloading efficiency are still remaining issues process goods packing. This study introduced pallet with telescopic height as middle to address these proposed a distribution scheme based on constraints three-dimensional time window. First, combining path optimization window cargo loading, solution model was established solve existing problem lowest total highest average vehicle rate. In addition, multi-objective transformed through linear weighting method. Second, we cluster customer nodes. order large number gaps generated hierarchy theory, adopt descending volume initial sequence design coding decoding for solving simulated anneal-genetic algorithm. Finally, effectiveness algorithm obtained comparison other algorithms simple using examples. It proved that packing pallets carriers can not only meet high rate but also improve speed, reduce penalty cost, operability loading. paper provides decision reference method under constraints.

Language: Английский

Citations

10