The Hospitals / Residents Problem with Couples: Complexity and Integer Programming Models

Automated deep-sea container terminals are the main hubs to move millions of containers in today's global supply chains. Terminal operators often decouple the landside and waterside operations by stacking containers in stacks perpendicular to the quay. Traditionally, a single automated stacking cranes (ASC) is deployed at each stack to handle containers. A recent trend is to use new configurations with more than one crane to improve efficiency. A variety of new configurations have been implemented, such as twin, double, and triple ASCs. In this paper, the authors explore and review the mixed integer programming models that have been developed for the stacking operations of these new configurations. They further discuss how these models can be extended to contemplate diverse operational constraints including precedence constraints, interference constraints, and other objective functions.

Download Full-text

Integer programming models for logical layout design of modular machining lines

Computers & Industrial Engineering ◽

10.1016/j.cie.2006.08.010 ◽

2006 ◽

Vol 51 (3) ◽

pp. 502-518 ◽

Cited By ~ 34

Author(s):

Sana Belmokhtar ◽

Alexandre Dolgui ◽

Nikolai Guschinsky ◽

Genrikh Levin

Keyword(s):

Integer Programming ◽

Layout Design ◽

Programming Models ◽

Machining Lines

Download Full-text

Solving Spreadsheet-Based Integer Programming Models: An Example from International Telecommunications

Decision Sciences ◽

10.1111/j.1540-5915.1990.tb01251.x ◽

1990 ◽

Vol 21 (4) ◽

pp. 808-824 ◽

Cited By ~ 2

Author(s):

Robert L. Carraway ◽

J. Michael Cummins ◽

James R. Freeland

Keyword(s):

Integer Programming ◽

Programming Models ◽

International Telecommunications

Download Full-text

New integer programming models for tactical and strategicunderground production scheduling

Mining Engineering ◽

10.19150/me.7360 ◽

2017 ◽

Vol 69 (3) ◽

pp. 37-42 ◽

Cited By ~ 6

Author(s):

B. King ◽

M. Goycoolea ◽

A. Newman

Keyword(s):

Integer Programming ◽

Production Scheduling ◽

Programming Models

Download Full-text

Tightening methods for continuous-time mixed-integer programming models for chemical production scheduling

AIChE Journal ◽

10.1002/aic.14249 ◽

2013 ◽

Vol 59 (12) ◽

pp. 4461-4467 ◽

Cited By ~ 13

Author(s):

Andres F. Merchan ◽

Sara Velez ◽

Christos T. Maravelias

Keyword(s):

Integer Programming ◽

Mixed Integer Programming ◽

Continuous Time ◽

Production Scheduling ◽

Programming Models ◽

Mixed Integer ◽

Chemical Production

Download Full-text

Locating Battery Swapping Stations for a Smart e-Bus System

Sustainability ◽

10.3390/su12031142 ◽

2020 ◽

Vol 12 (3) ◽

pp. 1142 ◽

Cited By ~ 2

Author(s):

Joon Moon ◽

Young Joo Kim ◽

Taesu Cheong ◽

Sang Hwa Song

Keyword(s):

Integer Programming ◽

Electric Vehicles ◽

Metropolitan Area ◽

Public Transportation ◽

Set Covering ◽

Programming Models ◽

Traffic Network ◽

Seoul Metropolitan Area ◽

Model Flow

With the growing interest and popularity of electric vehicles (EVs), the electrification of buses has been progressing recently. To achieve the seamless operation of electric buses (e-Buses) for public transportation, some bus stations should play the role of battery swapping station due to the limited travel range of e-Buses. In this study, we consider the problem of locating battery swapping stations for e-Buses on a passenger bus traffic network. For this purpose, we propose three integer programming models (set-covering-based model, flow-based model and path-based model) to model the problem of minimizing the number of stations needed. The models are applied and tested on the current bus routes in the Seoul metropolitan area of South Korea.

Download Full-text