Filters








64 Hits in 6.3 sec

Scheduling of Berthing Resources at a Marine Container Terminal via the use of Genetic Algorithms: Current and Future Research [chapter]

Maria Boile, Mihalis Golias, Sotirios Theofanis
2009 Evolutionary Computation  
that capture berth scheduling policies using the latter two formulations.  ...  Several formulations have been presented for the BSP, the QSP, and recently for the combination of the BSP and QSP, the berth and quay crane scheduling problem (BQSP).  ...  At the Scheduling of Berthing Resources at a Marine Container Terminal via the use of Genetic Algorithms: Current and Future Research 63 operational level, the allocation of berthing space to a set of  ... 
doi:10.5772/9602 fatcat:vbzvidcjdvaqhppqyvybfzh674

MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem

Agostinho Agra, Maryse Oliveira
2018 European Journal of Operational Research  
A branch and cut approach that uses the enhanced discretized model and incorporates the upper bounds provided by the RHH solution is proposed.  ...  In this paper we consider an integrated berth allocation and quay crane assignment and scheduling problem motivated by a real case where a heterogeneous set of cranes is considered.  ...  Acknowledgements This research was carried out with financial support from project UID/MAT/04106/2013 funded by the Portuguese Foundation for Science and Technology.  ... 
doi:10.1016/j.ejor.2017.05.040 fatcat:ocdx7p7aorczrmub7vqaeiifde

An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports

Abdellah Salhi, Ghazwan Alsoufi, Xinan Yang
2017 Annals of Operations Research  
This paper puts forward an integrated optimisation model that combines three distinct problems, namely berth allocation, quay crane assignment, and quay crane scheduling that arise in container ports.  ...  Larger size instances were also solved with the genetic algorithm, showing that this approach is capable of finding the optimal or near optimal solutions in realistic times.  ...  Acknowledgements We would like to thank Tom Corkhill and Stephen Peck of the Port of Felixstowe, UK, for providing us with real instances of the problems considered, as well as practical insights into  ... 
doi:10.1007/s10479-017-2539-7 pmid:30880858 pmcid:PMC6394332 fatcat:veadgzwnvjgl7lcbtsovdfo3fq

Integrated Berth Allocation and Time-Variant Quay Crane Scheduling with Tidal Impact in Approach Channel

Xiaogang Jiao, Feifeng Zheng, Ming Liu, Yinfeng Xu
2018 Discrete Dynamics in Nature and Society  
An integer linear programming model is developed, and then three heuristic algorithms, Genetic Algorithm, Hybrid Particle Swarm Optimization, and Hybrid Simulated Annealing, are proposed to solve the model  ...  This paper addresses the integrated problem of dynamic continuous berth allocation and time-variant quay crane scheduling in container terminals and introduces the factor of tidal impacts into the problem  ...  Acknowledgments This work was partially supported by the National Science  ... 
doi:10.1155/2018/9097047 fatcat:4a3lpot5lvbn5ezvapyoo5q5bq

Variable Neighborhood Search Methods for the Dynamic Minimum Cost Hybrid Berth Allocation Problem

Nataša Kovač, Tatjana Davidović, Zorica Stanimirović
2018 Information Technology and Control  
This study considers the Dynamic Minimum Cost Hybrid Berth Allocation Problem (DMCHBAP) with fixed handling times of vessels.  ...  The conducted computational analysis indicates that all four VNS-based methods represent promising solution approaches to DMCHBAP and similar problems in maritime transportation.  ...  Acknowledgments This research was partially supported by Serbian Ministry of Education, Science, and Technological Development under the grants nos. 174010 and 174033.  ... 
doi:10.5755/j01.itc.47.3.20420 fatcat:apw2iby5xreqhcaaxe7zz4sgnq

Lane Allocation Optimization in Container Seaport Gate System Considering Carbon Emissions

Zhihong Jin, Xin Lin, Linlin Zang, Weiwei Liu, Xisheng Xiao
2021 Sustainability  
Then, an improved branch-and-bound algorithm was designed, which includes further transforming the program into a linear program using the McCormick approximation method and iteratively generating a tighter  ...  In order to relieve gate congestion and reduce carbon emissions, this paper proposes a lane allocation framework combining the truck appointment system (TAS) for four types of trucks.  ...  They designed a hybrid genetic algorithm based on simulated annealing method.  ... 
doi:10.3390/su13073628 fatcat:dpe65eys3vgzhcama2tz3kkreu

A Review on Yard Management in Container Terminals

Lu Zhen, Xinjia Jiang, Loo Hay Lee, Ek Peng Chew
2013 Industrial Engineering & Management Systems  
The research area of yard management has attracted a lot of attentions from both the academia and the industrial practitioners.  ...  The yard management of a port has significant influences on the competitiveness of a port in the global shipping network.  ...  The space is allocated in terms of bays, and the rolling horizon approach is used when implementing the model.  ... 
doi:10.7232/iems.2013.12.4.289 fatcat:rthewcw7djccnnoxvpxoierk7i

Container terminal operation and operations research - a classification and literature review

Stefan Vo�, Robert Stahlbock, Dirk Steenken
2004 OR spectrum  
In this paper we describe and classify the main logistics processes and operations in container terminals and present a survey of methods for their optimization.  ...  In the last four decades the container as an essential part of a unitload-concept has achieved undoubted importance in international sea freight transportation.  ...  For real applications a hybrid approach using the MIP combined with fast heuristics on some special dispatching requests is suggested. A different MIP formulation can be found in [172] . Hanafi et al  ... 
doi:10.1007/s00291-003-0157-z fatcat:uhkyfwvd6rdabmkeyocroe2hly

Simulation optimization based ant colony algorithm for the uncertain quay crane scheduling problem

Naoufal Rouky, Mohamed Nezar Abourraja, Jaouad Boukachour, Dalila Boudebous, Ahmed El Hilali Alaoui, Fatima El Khoukhi
2019 International Journal of Industrial Engineering Computations  
The experimental results show that the optimization algorithm is competitive as compared to the existing methods and that the solutions found by the Simulation Optimization approach are more robust than  ...  An Ant Colony Optimization (ACO) meta-heuristic hybridized with a Variable Neighborhood Descent (VND) local search is proposed to determine the assignments of tasks to quay cranes and the sequences of  ...  Acknowledgement This research was co-financed by the European Regional Development Fund (ERDF) and by The Haute Normandie region under project 'CLASSE -Corridors Logistics: Application to the Seine Valley  ... 
doi:10.5267/j.ijiec.2018.2.002 fatcat:odbiov45qjdbbfq34ttgbnit5a

Revisiting dynamic constraint satisfaction for model-based planning

Jeremy Frank
2016 Knowledge engineering review (Print)  
As planning problems become more complex, it is increasingly useful to integrate complex constraints on time and resources into planning models, and use constraint reasoning approaches to help solve the  ...  We discuss how this new framework can inform the evolution of planning models, automated planning algorithms, and mixed-initiative planning.  ...  Acknowledgements We acknowledge the contributions Paul Morris, Minh Do and Tristan Smith made to early drafts of this paper. References Acknowledgements  ... 
doi:10.1017/s0269888916000242 fatcat:nt6cscltjbbpndpji2hs7vdsvy

Sea Container Terminals: New Technologies, OR Models, and Emerging Research Areas

Amir Hossein Gharehgozli, Debjit Roy, M. B. M. de Koster
2014 Social Science Research Network  
Due to a rapid growth in world trade and a huge increase in containerized goods, sea container terminals play a vital role in globe-spanning supply chains.  ...  Container terminals should be able to handle large ships, with large call sizes within the shortest time possible, and at competitive rates.  ...  They solve the model by a parallel genetic algorithm in combination with a heuristic algorithm.  ... 
doi:10.2139/ssrn.2469175 fatcat:hfx2sb35drenborqwv5ayq63wa

Variable neighbourhood search: methods and applications

Pierre Hansen, Nenad Mladenović, José A. Moreno Pérez
2008 4OR  
Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in perturbation  ...  It consists of steps for developing a heuristic for any particular problem. Those steps are common to the implementation of other metaheuristics.  ...  The third author was partly supported by project TIN2005-08404-C04-03 of the Spanish Government (with financial support from the E.U. under the FEDER project) and project PI042005/044 of the Canary Government  ... 
doi:10.1007/s10288-008-0089-1 fatcat:3iqvqsdfdra6fn6v3ne5rv2f64

Operations Research (OR) in Service Industries: A Comprehensive Review

Yiting Xing, Ling Li, Zhuming Bi, Marzena Wilamowska-Korsak, Li Zhang
2013 Systems research and behavioral science  
The conclusions on the limitations of existing studies and the demanding ORs in the service have been drawn from our summaries and observations from a comprehensive review in this field.  ...  The share of gross domestic product from the service industry reflects the competitiveness of a nation; the service industry in the USA accounts for around 80% of its gross domestic product, and it has  ...  Imai et al. (2007) addressed a berth allocation problem by a genetic algorithm at a multi-user container terminal with indented berths for fast handling.  ... 
doi:10.1002/sres.2185 fatcat:bmil4ahow5cmzesh64bjm6fd5y

An Annotated Bibliography of Personnel Scheduling and Rostering

A.T. Ernst, H. Jiang, M. Krishnamoorthy, B. Owens, D. Sier
2004 Annals of Operations Research  
Task assignment is the process of allocating a set of tasks, with specified start and end times and skill requirements, between a group of workers who have typically already been assigned to a set of working  ...  We classify these papers according to the type of problem addressed, the application areas covered and the methods used. In addition, a short summary is provided for each paper.  ...  Simple local search methods do not use the complicated moving strategies employed in many meta-heuristic approaches such as simulated annealing and tabu search.  ... 
doi:10.1023/b:anor.0000019087.46656.e2 fatcat:knk5qcsffng4ppfcu3dy3owuzy

A Study of Rescheduling Strategies for the Quay Crane Scheduling Problem under Random Disruptions

Christopher Expósito-Izquierdo, Eduardo Lalla-Ruiz, Belén Melian-Batista,, J. Marcos Moreno-Vega
2014 Inteligencia Artificial  
and unload containers onto/from a berthed container vessel.  ...  An evolutionary algorithm is used to find an initial solution of the problem with completely deterministic data, whereas several rescheduling strategies are integrated into a dynamism management system  ...  Christopher Expósito-Izquierdo and Eduardo Lalla-Ruiz thank the Canary Government the financial support they receive through their post-graduate grants.  ... 
doi:10.4114/intartif.vol17iss54pp35-47 fatcat:47lxc7sj6jdmfgstc4gczzkwm4
« Previous Showing results 1 — 15 out of 64 results