Efficient solution methods for the integer programming models of relocating empty containers in the hinterland transportation network

2017 ◽  
Vol 108 ◽  
pp. 52-59 ◽  
Author(s):  
Young-Soo Myung
Keyword(s):  
Integer Programming ◽  
Efficient Solution ◽  
Transportation Network ◽  
Programming Models ◽  
Solution Methods ◽  
Empty Containers

Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling

2011 ◽  
Vol 57 (1) ◽  
pp. 151-163 ◽  
Author(s):  
Marie-Claude Côté ◽  
Bernard Gendron ◽  
Louis-Martin Rousseau
Keyword(s):  
Integer Programming ◽  
Programming Models ◽  
Shift Scheduling

Mixed Integer Programming Models on Scheduling Automated Stacking Cranes

2021 ◽  
Vol 8 (4) ◽  
pp. 11-33
Author(s):  
Amir Gharehgozli ◽  
Orkideh Gharehgozli ◽  
Kunpeng Li
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Recent Trend ◽  
Container Terminals ◽  
Programming Models ◽  
Mixed Integer ◽  
Global Supply Chains ◽  
Objective Functions ◽  
Operational Constraints ◽  
Automated Stacking Cranes

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.

Integer programming models for logical layout design of modular machining lines

2006 ◽  
Vol 51 (3) ◽  
pp. 502-518 ◽  
Author(s):  
Sana Belmokhtar ◽  
Alexandre Dolgui ◽  
Nikolai Guschinsky ◽  
Genrikh Levin
Keyword(s):  
Integer Programming ◽  
Layout Design ◽  
Programming Models ◽  
Machining Lines

scholarly journals Transportation with volume discount: a case study of a logistic operator in Ghana

2014 ◽  
Vol 8 (2) ◽  
pp. 7-37
Author(s):  
Abdul-Salam Sibidoo Mubashiru
Keyword(s):  
Integer Programming ◽  
Production Scheduling ◽  
Transportation Problem ◽  
Transportation Network ◽  
Supply And Demand ◽  
Network Models ◽  
Cost Effective ◽  
Capital Budgeting ◽  
Integer Programming Problems ◽  
Optimality Algorithm

Network models and integer programming are well known variety of decision making problems. A very useful and widespread area of application is the management and efficient use of scarce resources to increase productivity. These applications include operational problems such as the distributions of goods, production scheduling and machine sequencing, and planning problems such as capital budgeting facility allocation, portfolio selection, and design problems such as telecommunication and transportation network design. The transportation problem, which is one of network integer programming problems is a problem that deals with distributing any commodity from any group of 'sources' to any group of destinations or 'sinks' in the most cost effective way with a given 'supply' and 'demand' constraints. Depending on the nature of the cost function, the transportation problem can be categorized into linear and nonlinear transportation problem. We applied Karush-Kuhn-Tucker (KKT) optimality algorithm to solve our problem of transportation with volume discount for a logistic operator in Ghana.

Sign in / Sign up

Export Citation Format

Share Document