scholarly journals Can agents measure up? A comparative study of an agent-based and on-line optimization approach for a drayage problem with uncertainty

2010 ◽  
Vol 18 (1) ◽  
pp. 99-119 ◽  
Author(s):  
Tamás Máhr ◽  
Jordan Srour ◽  
Mathijs de Weerdt ◽  
Rob Zuidwijk
Author(s):  
Tamás Máhr ◽  
F. Jordan Srour ◽  
Mathijs de Weerdt ◽  
Rob Zuidwijk

While intermodal freight transport has the potential to introduce efficiency to the transport network,this transport method also suffers from uncertainty at the interface of modes. For example, trucks moving containers to and from a port terminal are often uncertain as to when exactly their container will be released from the ship, from the stack, or from customs. This leads to much difficulty and inefficiency in planning a profitable routing for multiple containers in one day. In this chapter, the authors examine agent-based solutions as a mechanism to handle job arrival uncertainty in the context of a drayage case at the Port of Rotterdam. They compare their agent-based solution approach to a wellknown on-line optimization approach and study the comparative performance of both systems across four scenarios of varying job arrival uncertainty. The chapter concludes that when less than 50% of all jobs are known at the start of the day then an agent-based approach performs competitively with an on-line optimization approach.


IEEE Access ◽  
2017 ◽  
Vol 5 ◽  
pp. 20393-20407 ◽  
Author(s):  
Miguel G. Villarreal-Cervantes ◽  
Alejandro Rodriguez-Molina ◽  
Consuelo-Varinia Garcia-Mendoza ◽  
Ollin Penaloza-Mejia ◽  
Gabriel Sepulveda-Cervantes

Author(s):  
Saurabh Deshpande ◽  
Jonathan Cagan

Abstract Many optimization problems, such as manufacturing process planning optimization, are difficult problems due to the large number of potential configurations (process sequences) and associated (process) parameters. In addition, the search space is highly discontinuous and multi-modal. This paper introduces an agent based optimization algorithm that combines stochastic optimization techniques with knowledge based search. The motivation is that such a merging takes advantage of the benefits of stochastic optimization and accelerates the search process using domain knowledge. The result of applying this algorithm to computerized manufacturing process models is presented.


2019 ◽  
Vol 34 (Supplement_1) ◽  
Author(s):  
Varvara Kousoula ◽  
Panagiotis Georgianos ◽  
Elias Minasidis ◽  
Konstantinos Mavromatidis ◽  
Christos Syrganis ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document