Natural Optimization Algorithms for the Cross-Dock Door Assignment Problem

Tarhini, Abbas; Yunis, Manal M.; Chamseddine, Mohamad

doi:10.1109/tits.2016.2519104

Cited by 12 publications

(10 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Inventory control of reverse logistics for shipping electronic commerce was presented [21] based on an improved multi-objective particle swarm algorithm, and it showed effective results. Another work [22] presented an algorithm to minimize the traveling distance of the handling machines when moving the cargo from an inbound truck to an outbound truck. This problem that was discussed is known as the cross-dock door assignment problem (CDAP), and the solution was represented by a modified classical mathematical model.…”

Section: Content Analysis and Discussionmentioning

confidence: 99%

Analytical Review on the Modern Optimization Algorithms in Logistics

Akkad

Bányai

2020

ALS

View full text Add to dashboard Cite

Optimization algorithms are used to reach the optimum solution from a set of available alternatives within a short time relatively. With having complex problems in the logistics area, the optimization algorithms evolved from traditional mathematical approaches to modern ones that use heuristic and metaheuristic approaches. Within this paper, the authors present an analytical review that includes illustrative and content analysis for the used modern algorithms in the logistics area. The analysis shows accelerated progress in using the heuristic/metaheuristic algorithms for logistics applications. It also shows the strong presence of hybrid algorithms that use heuristic and metaheuristic approaches. Those hybrid algorithms are providing very efficient results.

show abstract

Section: Content Analysis and Discussionmentioning

confidence: 99%

Analytical Review on the Modern Optimization Algorithms in Logistics

Akkad

Bányai

2020

ALS

View full text Add to dashboard Cite

show abstract

“…Tootkaleh et al (2016) explicitly modelled the storage of products in a separate area when products of an inbound truck arrive after the outbound truck has already left the CD terminal due to a departure deadline. Tarhini et al (2016) presented a scatter search and a genetic algorithm to deal with CDAP based on the problem defined by Tsui and Chang (1990). Fedtke and Boysen (2017) discussed the assignment of inbound and outbound destinations connected via different conveyor segments to increase the throughput of the sortation system.…”

Section: Literature Reviewmentioning

confidence: 99%

“…However, apart from the Bartholdi and Gue (2000) who discussed forklift congestion in CD exclusively, almost none of the studies have investigated the congestion of forklifts in their formulations. In this study, we focus on operational level of a CD system, and are interested in controlling forklift floor congestion in a terminal and minimising total WTD based on a modified model developed by Tarhini et al (2016).…”

Section: Literature Reviewmentioning

confidence: 99%

“…In this section, we mathematically formulate a CDAP problem in an I-shaped CD terminal. The proposed mathematical model in this study is referred to as the previous work of Tarhini et al (2016) in which the MINLP model was presented to find the best solution for door assignment and sequencing in a multi-door CD problem. Unlike Tarhini et al (2016) the unit of flow in the model is the unit forklift capacity to carry the original supplier-customer flow.…”

Section: Problem Description and Mathematical Formulationmentioning

confidence: 99%

“…The proposed mathematical model in this study is referred to as the previous work of Tarhini et al (2016) in which the MINLP model was presented to find the best solution for door assignment and sequencing in a multi-door CD problem. Unlike Tarhini et al (2016) the unit of flow in the model is the unit forklift capacity to carry the original supplier-customer flow. The product transshipment cost between each pair of inbound-outbound doors is one dollar per forklift-unit, and forklifts can only walk 'horizontally' or 'vertically', i.e., the Manhattan distance computation.…”

Section: Problem Description and Mathematical Formulationmentioning

confidence: 99%

See 2 more Smart Citations

An optimisation model to increase the cross-dockings operational utilisation

Ghomi,

Nezami,

Shokoohyar

et al. 2024

IJLSM

View full text Add to dashboard Cite

Introducing a new version of a cross-docking assignment problem when forklifts carry bulk materials, we address an operational solution to reduce the impact of forklifts congestion in centre of terminals. We develop a mixed-integer bilinear programming model, a Tabu-search algorithm, where the main objective of the model is still to minimize the total transshipment costs, and additionally trying to minimize the weighted forklifts travelled distance (WTD) and the weighted unloading/loading labour costs at inbound and outbound doors (WLC). We hypothesize that longer WTD could shift the location of weighted forklift congestion concentration from the centre of the terminal toward the sides. We assuming four cost pattern's distributions, all are supposed to lead high flows to doors with low labour costs, which ultimately impact the total WTD, WLC, and TTC. The proposed Tabu-search outperform CPLEX by finding a set of a diverse and high-quality solution within a reasonable computing time.V. Ghomi et al.

show abstract