NDLI: POPMUSIC as a matheuristic for the berth allocation problem

Content Provider	Springer Nature Link
Author	Voß, Stefan Lalla Ruiz, Eduardo
Copyright Year	2014
Abstract	The Berth Allocation Problem aims at assigning and scheduling incoming vessels to berthing positions along the quay of a container terminal. This problem is a well-known optimization problem within maritime shipping. In order to address it, we propose two POPMUSIC (Partial Optimization Metaheuristic Under Special Intensification Conditions) approaches that incorporate an existing mathematical programming formulation. POPMUSIC is an efficient metaheuristic that may serve as blueprint for matheuristics approaches once hybridized with mathematical programming. In this regard, the use of exact methods for solving the sub-problems defined in the POPMUSIC template highlight an interoperation between metaheuristics and mathematical programming techniques, which provide a new type of approach for this problem. The computational experiments reveal excellent results.
Ending Page	189
Page Count	17
Starting Page	173
File Format	PDF
ISSN	10122443
e-ISSN	15737470
Journal	Annals of Mathematics and Artificial Intelligence
Issue Number	1-2
Volume Number	76
Language	English
Publisher	Springer International Publishing
Publisher Date	2014-12-31
Publisher Place	Cham
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Applications of mathematical programming Problem solving (heuristics, search strategies, etc.) POPMUSIC Transportation, logistics Approximation methods and heuristics Computer Science Artificial Intelligence (incl. Robotics) Berth allocation problem Matheuristic Mathematics Discrete location and assignment Statistical Physics, Dynamical Systems and Complexity
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Artificial Intelligence

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A hybrid clonal selection algorithm for the location routing problem with stochastic demands

Models and algorithms for competitive facility location problems with different customer behavior

On the investigation of hyper-heuristics on a financial forecasting problem

Heuristics as Markov chains

Set-structured and cost-sharing heuristics for classical planning

MOO—MicroJIAC agents operating oxen

Weight constraint programs with evaluable functions

On look-ahead heuristics in disjunctive logic programming

Argumentation frameworks as constraint satisfaction problems

POPMUSIC as a matheuristic for the berth allocation problem

Similar Documents

A hybrid clonal selection algorithm for the location routing problem with stochastic demands

Models and algorithms for competitive facility location problems with different customer behavior

On the investigation of hyper-heuristics on a financial forecasting problem

Heuristics as Markov chains

Set-structured and cost-sharing heuristics for classical planning

MOO—MicroJIAC agents operating oxen

Weight constraint programs with evaluable functions

On look-ahead heuristics in disjunctive logic programming

Argumentation frameworks as constraint satisfaction problems

POPMUSIC as a matheuristic for the berth allocation problem