Sciweavers

10 search results - page 1 / 2
» A critical-shaking neighborhood search for the yard allocati...
Sort
View
EOR
2006
139views more  EOR 2006»
13 years 11 months ago
A critical-shaking neighborhood search for the yard allocation problem
The yard allocation problem (YAP) is a real-life resource allocation problem faced by the Port of Singapore Authority (PSA). As the problem is NP-hard, we propose an effective met...
Andrew Lim, Zhou Xu
GECCO
2003
Springer
115views Optimization» more  GECCO 2003»
14 years 4 months ago
The General Yard Allocation Problem
The General Yard Allocation Problem (GYAP) is a resource allocation problem faced by the Port of Singapore Authority. Here, space allocation for cargo is minimized for all incoming...
Ping Chen, Zhaohui Fu, Andrew Lim, Brian Rodrigues
EVOW
2012
Springer
12 years 6 months ago
A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem
Abstract. We consider the two-echelon location-routing problem (2ELRP), a well-known problem in freight distribution arising when establishing a two-level transport system with lim...
Martin Schwengerer, Sandro Pirkwieser, Günthe...
SAC
2003
ACM
14 years 4 months ago
Manpower Scheduling with Time Windows
In this paper, we propose a manpower allocation model with time windows which is of practical interest to serviceman scheduling operations. Specifically, this problem originates f...
Andrew Lim, Brian Rodrigues, Lei Song
HM
2009
Springer
145views Optimization» more  HM 2009»
14 years 3 months ago
Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows
Abstract. In this work we extend a VNS for the periodic vehicle routing problem with time windows (PVRPTW) to a multiple VNS (mVNS) where several VNS instances are applied cooperat...
Sandro Pirkwieser, Günther R. Raidl