Bi-objective overlapped links vehicle routing problem for risk minimizing valuables transportation

Mazdarani, Fatemeh; Ghannadpour, Seyed Farid; Zandieh, Fatemeh

doi:10.1016/j.cor.2023.106177

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

2024

Publication Types

Select...

Article3

Preprint2

Book1

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 7 publications

(1 citation statement)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…companies use numerous tools, which include both Transportation Management System (TMS) software and web mapping services. These solutions are designed for a personal computer, but they also function as mobile or Internet applications in which dedicated optimization algorithms are implemented [4], [5], which is one of the main directions of research in the field of transport [6].…”

mentioning

confidence: 99%

Routemighty: Route Planning Software Engine for Abnormal Trucks Based on Graph Database Using Neo4j

Betkier¹

2023

Preprint

View full text Add to dashboard Cite

mentioning

confidence: 99%

Routemighty: Route Planning Software Engine for Abnormal Trucks Based on Graph Database Using Neo4j

Betkier¹

2023

Preprint

View full text Add to dashboard Cite

The Heterogeneous Fleet Risk-Constrained Vehicle Routing Problem in Humanitarian Logistics

van Steenbergen,

Lalla-Ruiz,

van Heeswijk

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Modified genetic algorithm to solve worker assignment problem with time windows

Gozali

2024

Industrial Artificial Intelligence

View full text Add to dashboard Cite

In recent years, the demand for electronic products has been increasing rapidly. T mounting technology (SMT) line is one of the production areas for electronic products, directly affecting this situation. In an SMT line, multiple machines mount electronic parts to the board. The worker must complete work when the parts used in these machines are within the remaining parts available for replacement. When a worker fails to replace parts at the right time, the production line stops, and delays occur. Besides, there may be a designated worker who should be assigned to each task. In the current situation, workers’ work procedures are not optimized, so they should schedule work procedures for each worker. This problem is called Worker Assignment Problem with Time Window (WAPTW). This paper proposes a method to solve WAPTW called Genetic Algorithm with Local Restriction (GALR). GALR combines a genetic algorithm (GA) and local search with local restriction. This paper’s main contribution is introducing WAPTW as a novel real-world optimization problem in an electricity company, its mathematical formulation, and a proposed GALR to solve WAPTW. The experiment shows that the proposed method could yield the best result in real-world WAPTW compared with other methods.

show abstract

Bi-objective overlapped links vehicle routing problem for risk minimizing valuables transportation

Cited by 7 publications

References 42 publications

Routemighty: Route Planning Software Engine for Abnormal Trucks Based on Graph Database Using Neo4j

Routemighty: Route Planning Software Engine for Abnormal Trucks Based on Graph Database Using Neo4j

The Heterogeneous Fleet Risk-Constrained Vehicle Routing Problem in Humanitarian Logistics

Modified genetic algorithm to solve worker assignment problem with time windows

Contact Info

Product

Resources

About