Parking slot assignment for urban distribution: Models and formulations☆

A key element to enhance urban distribution is the adequate management of parking space, particularly for loading and unloading operations. An in-advance booking system able to be adjusted to users needs can be a very useful tool for city councils. Such a tool should be fed with criteria for allocating requests to time slots. In this paper we discuss alternative criteria for the parking slot assignment problem for urban distribution and we propose the use of mathematical programming formulations to model them. Several models are proposed, analyzed and compared among them. Extensive computational experience is presented with a detailed analysis and comparison, which provides quantitative indicators of the quality of each of the proposed models.

[1]  Luigi Moccia,et al.  New Optimization Models and Algorithms for the Management of Maritime Container Terminals , 2005 .

[2]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[3]  Paolo Toth,et al.  Solution of the Train Platforming Problem , 2011, Transp. Sci..

[4]  A Bolat,et al.  Models and a genetic algorithm for static aircraft-gate assignment problem , 2001, J. Oper. Res. Soc..

[5]  Arie Tamir,et al.  The k-centrum multi-facility location problem , 2001, Discret. Appl. Math..

[6]  Quan-Ke Pan,et al.  An estimation of distribution algorithm for lot-streaming flow shop problems with setup times , 2012 .

[7]  Jesús Muñuzuri,et al.  Pilot Demonstration of Web-Based Loading Zone Reservation System , 2006 .

[8]  M. J. Gerra,et al.  An interactive city planning model , 1973 .

[9]  Tom Cherrett,et al.  Loading bay booking and control for urban freight , 2011 .

[10]  Francesco Mason,et al.  Properties of the k-centra in a tree network , 1985, Networks.

[11]  Wieslaw Kubiak,et al.  Proportional Optimization And Fairness , 2008 .

[12]  Christos Koulamas.  Single-machine scheduling with time windows and earliness/tardiness penalties , 1996 .

[13]  T. Lowe,et al.  Thek-centrum shortest path problem , 2006 .

[14]  Christos Koulamas.  Maximizing the weighted number of on-time jobs in single machine scheduling with time windows , 1997 .

[15]  Kap Hwan Kim,et al.  A scheduling method for Berth and Quay cranes , 2003 .

[16]  Jonathan Rosenhead,et al.  Operational research in urban planning , 1981 .

[17]  T.C.E. Cheng,et al.  Single-machine batch delivery scheduling with an assignable common due window , 2013 .

[18]  Miquel Angel Piera,et al.  Robust gate assignment procedures from an airport management perspective , 2015 .

[19]  Peter J. Slater,et al.  Centers to centroids in graphs , 1978, J. Graph Theory.

[20]  Mihalis M. Golias,et al.  The Berth Allocation Problem: A Formulation Reflecting Time Window Service Deadlines , 2007 .

[21]  Mehmet Mutlu Yenisey,et al.  Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends , 2014 .

[22]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .