2020
DOI: 10.1016/j.cie.2020.106832
|View full text |Cite
|
Sign up to set email alerts
|

A new bi-objective vehicle routing-scheduling problem with cross-docking: Mathematical model and algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 30 publications
(7 citation statements)
references
References 66 publications
0
7
0
Order By: Relevance
“…The numerical results show the effectiveness of the proposed algorithm compared to the two multifunctional meta-heuristic algorithms (namely the non-dominant genetic algorithm (NSGA-II) and the Pareto Archived Evolution Strategy (PAES)). Goodarzi et al also report the findings of a hypothetical case study in a retail chain in Houston, Texas [24] .…”
Section: Research Categories Based On the Indexmentioning
confidence: 99%
See 1 more Smart Citation
“…The numerical results show the effectiveness of the proposed algorithm compared to the two multifunctional meta-heuristic algorithms (namely the non-dominant genetic algorithm (NSGA-II) and the Pareto Archived Evolution Strategy (PAES)). Goodarzi et al also report the findings of a hypothetical case study in a retail chain in Houston, Texas [24] .…”
Section: Research Categories Based On the Indexmentioning
confidence: 99%
“…In the study, Goodarzi et al [24] addressed the problem of cross-vehicle vehicle routing, hich considers truck planning, splitting delivery, and delivery orders with time windows at supplier and retailer locations, while it optimizes the opposite goals (i.e., cost efficiency and accountability). The goal is to minimize the total operating cost and the sum of the maximum early and late.…”
Section: Research Categories Based On the Indexmentioning
confidence: 99%
“…At present, there are many studies [18] in the existing literature on the problem of pick-up and delivery vehicle routing with time windows. Some authors have proposed accurate solution methods for PDVRPTW, and common solution methods include tabu search [19,20], genetic algorithm [21,22], simulated annealing [23,24], ant colony algorithm [25][26][27], and other intelligent algorithms. In addition, some new algorithms have been used to solve this problem.…”
Section: Takeout Deliverymentioning
confidence: 99%
“…Multiobjective methods for vehicle routing and scheduling problems within supply chain problems have been studied recently by Rahbari et al ( 2019 ), Goodarzi et al ( 2020 ), and Shahabi-Shahmiri et al ( 2021 ). A bi-objective MILP model for the vehicle routing and scheduling problem with cross-docking for perishable products has been studied by Rahbari et al ( 2019 ).…”
Section: Literature Reviewmentioning
confidence: 99%
“…In this work, two robust models are developed when the travel time of the outbound vehicles and the freshness-life of the products is uncertain. Goodarzi et al ( 2020 ) address a vehicle routing problem with cross-docking (VRPCD) by considering truck scheduling and splitting pickup and delivery orders with time windows at supplier and retailer locations. Two conflict objectives are considered: minimization of the total operational cost and the sum of the maximum earliness and tardiness.…”
Section: Literature Reviewmentioning
confidence: 99%