Multi-agent Based Truck Scheduling Using Ant Colony Intelligence in a Cross-Docking Platform

被引:0
|
作者
Zouhaier, Houda [1 ]
Ben Said, Lamjed [1 ]
机构
[1] Univ Tunis, Higher Inst Management Tunis, Lab SOIE, Tunis, Tunisia
来源
INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS (ISDA 2016) | 2017年 / 557卷
关键词
Resolution; Distributed approach; Real-time scheduling; Ant colony intelligence; Disruption; Agent based modeling; OPTIMIZATION;
D O I
10.1007/978-3-319-53480-0_45
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The management of trucks in a cross-docking platform is a process under five steps: the arrival, the control, the unloading, the transfer and finally the loading. In each of these steps, a sequence of decisions arise. To achieve an optimal and robust solutions, the inter-dependencies between the different planning functions should be taken into account, and scheduling decisions must be made simultaneously. The truck scheduling should incorporate a real-time information regarding the resource availability and truck arrival and departure times which are crucial in a cross-docking platform. In this work, we present how the autonomous, distributed, and dynamic nature of the multi-agent paradigm by introducing ant colony intelligence (ACI) can provide a framework for the cooperation of various functions of the cross-dock to develop a robust schedule. The goal of this paper is to find an optimal dynamic scheduling system related to the parking lot and dock operations at the cross-dock facility. The proposed approach represents ACI integrated with both truck agents and resource agents to solve the truck scheduling problem in a dynamic environment.
引用
收藏
页码:457 / 466
页数:10
相关论文
共 50 条
  • [31] An application oriented multi-agent based approach to dynamic truck scheduling at Cross-dock
    Zouhaier, Houda
    Ben Said, Lamjed
    2016 17TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES (PDCAT), 2016, : 233 - 239
  • [32] A Lagrangian heuristics for the truck scheduling problem in multi-door, multi-product Cross-Docking with constant processing
    Gaudioso, Manlio
    Monaco, Maria Flavia
    Sammarra, Marcello
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2021, 101
  • [33] Ant colony optimization algorithm to solve for the transportation problem of cross-docking network
    Musa, Rami
    Arnaout, Jean-Paul
    Jung, Hosang
    COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 59 (01) : 85 - 92
  • [34] Parallel-machine scheduling methodology for a multi-dock truck sequencing problem in a cross-docking center
    Nogueira, Thiago Henrique
    Coutinho, Felipe Provezano
    Ribeiro, Rafael Pereira
    Ravetti, Martin Gomez
    COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 143
  • [35] A truck scheduling problem at a cross-docking facility with mixed service mode dock doors
    Vandani, Bchnam
    Shahramfard, Shayan
    ENGINEERING COMPUTATIONS, 2019, 36 (06) : 1977 - 2009
  • [36] Ant colony intelligence in agent coordination for dynamic manufacturing scheduling
    Xiang, Wei
    Lee, Heow Pueh
    2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 3527 - +
  • [37] Implementation of ant colony algorithm based-on multi-agent system
    He, JM
    Min, R
    Wang, YY
    NETWORKING AND MOBILE COMPUTING, PROCEEDINGS, 2005, 3619 : 1234 - 1242
  • [38] The research on the decision algorithms of Multi-agent based on ant colony of WebGIS
    Li, Guangru
    Li, Yuanhui
    Sun, Zhi
    2007 IEEE INTERNATIONAL CONFERENCE ON CONTROL AND AUTOMATION, VOLS 1-7, 2007, : 2260 - 2264
  • [39] A Multi-agent Based on Ant Colony Model for Urban Traffic Management
    Sabbani, Imad
    Youssfi, Mohamed
    Bouattane, Omar
    PROCEEDINGS OF 2016 5TH INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS), 2016, : 793 - 798
  • [40] Heuristic algorithms for truck scheduling of cross-docking operations in cold-chain logistics
    Zheng, Feifeng
    Pang, Yaxin
    Xu, Yinfeng
    Liu, Ming
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2021, 59 (21) : 6579 - 6600