A bi-objective truck scheduling problem in a cross-docking center with probability of breakdown for trucks
•We consider possibility of breakdown for trucks in cross-docking truck scheduling.•We assume that trucks may be broken based on a Poisson distribution function.•We mathematically model the problem.•We employ a complete enumeration method to obtain optimum results.•We employ multi-objective meta-heu...
Saved in:
Published in | Computers & industrial engineering Vol. 96; pp. 180 - 191 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
New York
Elsevier Ltd
01.06.2016
Pergamon Press Inc |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | •We consider possibility of breakdown for trucks in cross-docking truck scheduling.•We assume that trucks may be broken based on a Poisson distribution function.•We mathematically model the problem.•We employ a complete enumeration method to obtain optimum results.•We employ multi-objective meta-heuristics to solve large-scale problems.
This paper addresses a truck scheduling problem in a cross-docking center, in which trucks may confront breakdowns during their service times. In fact, the number of breakdowns in one unit of time for each truck follows a Poisson distribution function. On the other hand, customers are promised to receive required items in a pre-determined time; so, a due date is assigned to each outbound truck. Thus, a bi-objective linear mathematical model is developed inspired by models in the body of the respective literature. A complete enumeration method is employed to find optimum solutions subject to the complexity of large-scale problems, and we modify three multi-objective meta-heuristics; namely, Non-dominated Sorting Genetic Algorithm II (NSGA-II), Multi-Objective Simulated Annealing (MOSA) and Multi-Objective Differential Evolutionary (MODE). In addition, a Response Surface Methodology (RSM) as a statistical tool is used to find an appropriate amount of factors associated with the forgoing meta-heuristics. Finally, the performances of the proposed meta-heuristics are measured and compared with each other. |
---|---|
Bibliography: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
ISSN: | 0360-8352 1879-0550 |
DOI: | 10.1016/j.cie.2016.03.023 |