1,571 Hits in 6.6 sec

A branch and price approach for the container relocation problem

Elisabeth Zehendner, Dominique Feillet
2014 International Journal of Production Research  
This problem is known as the container relocation problem. We apply an exact and a heuristic column generation approach to this problem.  ...  First results are very promising since both approaches provide very tight lower bounds on the minimum number of relocations. Block 2 Block 3 Block 1 Yard crane Transfer points Key:  ...  Outlook We presented an exact and a heuristic column generation approach for the container relocation problem.  ... 
doi:10.1080/00207543.2014.965358 fatcat:5yaraqua3fazvpzdgyjehsgkza

A Study on the Block Relocation Problem: Lower Bound Derivations and Strong Formulations [article]

Chao Lu and Bo Zeng and Shixin Liu
2019 arXiv   pre-print
; (iii) propose and employ a couple of new critical substructures concepts to analyze the BRP and obtain a lower bound that dominates all existing ones; (iv) build a new and strong mixed integer programming  ...  The block relocation problem (BRP) is a fundamental operational issue in modern warehouse and yard management, which, however, is very challenging to solve.  ...  In Section IV, we build an MIP formulation for the BRP. Also, a novel MIP formulation based iterative procedure is developed to compute exact BRP solutions.  ... 
arXiv:1904.03347v3 fatcat:nqdjhlifz5agjnocgmaiaybrde

Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence

Michael J. Brusco, Douglas Steinley
2009 Journal of Mathematical Psychology  
In exploratory cases where a blockmodel structure is not prespecified, we recommend a two-stage procedure, where a heuristic method is first used to identify an image matrix and the integer program is  ...  Although best suited for ideal block structures associated with structural equivalence, the integer programming models have the flexibility to accommodate functional indices pertaining to regular equivalence  ...  Author Manuscript Brusco and Steinley Page 19 Table 2 Results for RE1: Everett's network matrix in top panel, and the 3-cluster blockmodel produced by RE1 in the bottom panel.  ... 
doi:10.1016/ pmid:29769750 pmcid:PMC5951192 fatcat:fn7q2kvfhzcvhgcztowxfyyl5m

A Local-Search Based Heuristic for the Unrestricted Block Relocation Problem [article]

Dominique Feillet, Sophie N. Parragh, Fabien Tricoire
2019 arXiv   pre-print
The unrestricted block relocation problem is an important optimization problem encountered at terminals, where containers are stored in stacks.  ...  A container move can be either the retrieval of a container or the relocation of a certain container on top of a stack to another stack.  ...  Acknowledgments The authors thank the referees for their acute comments, which significantly contributed to enhance the quality of this paper.  ... 
arXiv:1809.08201v2 fatcat:267kbj3eure7zjb2wqtuebcem4

Simultaneous Train Rescheduling through Cancelling, Delaying and Re-Ordering Policies: Three-Phase Solution Method with Guaranteed Optimality

Mohammad Tamannaei, Mahmoud Saffarzadeh, Amin Jamili, Seyedehsan Seyedabrishami
2017 Scientia Iranica. International Journal of Science and Technology  
In this article, a new approach is presented to solve the double-track railway rescheduling problem, when an incident occurs into one of the block sections of the railway.  ...  To nd the optimal con ict-free timetables compatible with the approach, a mathematical model and an exact three-phase solution method are proposed.  ...  Several heuristics based on mixtures of the two formulations were proposed. An approach proposed by Caimi et al.  ... 
doi:10.24200/sci.2017.2382 fatcat:xc65d5ccrjbdpi2wdqtjh7huw4

An efficient exact model for the cell formation problem with a variable number of production cells [article]

Ilya Bychkov, Mikhail Batsyn
2017 arXiv   pre-print
In this paper we suggest a new mixed-integer linear programming model for solving the cell formation problem with a variable number of manufacturing cells.  ...  However, only a few authors have aimed to develop exact methods and most of these methods have some major restrictions such as a fixed number of production cells for example.  ...  The second approach is a branch-and-bound algorithm combined with a relocation heuristic to obtain an initial solution.  ... 
arXiv:1701.02472v2 fatcat:2ky25m2dhfcbznhd3zbm6ua224

Maximum Closeness Centrality k-Clubs: A Study of Dock-Less Bike Sharing

Ali Rahim Taleqani, Chrysafis Vogiatzis, Jill Hough
2020 Journal of Advanced Transportation  
For the proposed problem, we first derive its computational complexity and show that it is NP-hard (by reduction from the 3-SATISFIABILITY problem), and then provide an integer programming formulation.  ...  Due to its computational complexity, the problem cannot be solved exactly in a large-scale setting, as is such of an urban area.  ...  In this paper, we propose an integer programming formulation and a heuristic algorithm to find the most centralized -club in a transportation network based on closeness centrality. e resultant -club consists  ... 
doi:10.1155/2020/1275851 fatcat:obsvbo6xnzdm5aajnwhhswp5km

A Survey of Controller Placement Problem in Software Defined Networks [article]

Abha Kumari, Ashok Singh Sairam
2019 arXiv   pre-print
This problem is referred to as the controller placement problem (CPP) and this paper is mainly concerned with the CPP solution techniques.  ...  Software Defined Network (SDN) is an emerging network paradigm which provides a centralized view of the network by decoupling the network control plane from the data plane.  ...  In the second formulation, the response time of each controller is restricted to be less than a pre-defined value. The problems are formulated as an integer linear programming. Abdel et al.  ... 
arXiv:1905.04649v1 fatcat:cqu3jm5ct5fdlmrv5zeicdhmie

An Integrated Optimization Model for the Multi-Port Stowage Planning and the Container Relocation Problems [article]

Catarina Junqueira, Miguel Paredes Quiñones, Anibal Tavares de Azevedo, Cleber Damião Rocco, Takaaki Ohishi
2020 arXiv   pre-print
This problem is formulated as a binary mathematical programming model that must find the containers' move sequence so that the number of relocations during the whole journey of a ship, as well as the associated  ...  This paper introduces a new optimization model that integrates the multi-port stowage planning problem with the container relocation problem.  ...  [43] presented a unified integer programming model for solving the Pre-Marshalling and the container relocation problem in the restricted and unrestricted variant.  ... 
arXiv:2006.06795v1 fatcat:ai4kdz5rbfd7vkhe4l3wq4emfe

An efficient ILP-based scheduling algorithm for control-dominated VHDL descriptions

Michael Münch, Norbert Wehn, Manfred Glesner
1997 ACM Transactions on Design Automation of Electronic Systems  
The scheduling problem is mapped onto an integer linear program (ILP) which can be constrained to be solvable in polynomial time, but still permits optimizing the statement sequence across basic block  ...  It is based on a codetransformational approach which fully preserves the VHDL semantics.  ...  The scheduling problem is formulated in terms of an integer linear program [10] , the problem size of which is independent of the number of paths.  ... 
doi:10.1145/268424.268428 fatcat:fzekxsnmvbe27pnxbelxoqwzxa

Selected Topics in Column Generation

Marco E. Lübbecke, Jacques Desrosiers
2005 Operations Research  
Dantzig-Wolfe decomposition and column generation, devised for linear programs, is a success story in large-scale integer programming.  ...  It stimulated careful initializations, sophisticated solution techniques for the restricted master problem and subproblem, as well as better overall performance.  ...  Pricing Integer Programs When the compact formulation (15) is an integer program, so is the pricing problem.  ... 
doi:10.1287/opre.1050.0234 fatcat:w2tpwvpbfzbdhc7hnwjo2ijxfm

A Review of Operations Research in Mine Planning

Alexandra M. Newman, Enrique Rubio, Rodrigo Caro, Andrés Weintraub, Kelly Eurek
2010 Interfaces  
Applications of operations research to mine planning date back to the 1960s.  ...  In this paper, we review several decades of such literature with a particular emphasis on more recent work, suggestions for emerging areas, and highlights of successful industry applications.  ...  Acknowledgments We would like to recognize funding for this paper provided by the University of Chile's Milenium Institute Complex Engineering Systems and Fondecyt Project.  ... 
doi:10.1287/inte.1090.0492 fatcat:tkum5zfa6be6rfk4vlcgn4n2xe

Machine Reliability in a Dynamic Cellular Manufacturing System: A Comprehensive Approach to a Cell Layout Problem

Amir-Mohammad Golmohammadi, Mahboobeh Honarvar, Hasan Hosseini-Nasab, Reza Tavakkoli-MOghaddam
2018 International Journal of Industrial Engineering and Production Research  
This paper represents a new nonlinear mathematical programming model for dynamic cell formation that employs the rectilinear distance notion to determine the layout in the continuous space.  ...  The fundamental function of a cellular manufacturing system (CMS) is based on definition and recognition of a type of similarity among parts that should be produced in a planning period.  ...  Safaei et al. [25] solved the integer mathematical model related to the CF problem with a dynamic and uncertain environment employing fuzzy programming.  ... 
doaj:0ef3bc102ec24198ac7018beda5d8334 fatcat:k4r4b27gpfejnltyws5z55tgwu

Optimizing container movements using one and two automated stacking cranes

Ioannis Zyngiridis, Johannes Royset, Robert Dell
2009 Journal of Industrial and Management Optimization  
In this paper, we formulate integer linear programs to prescribe movements to transport and stack containers in storage yards using one and two equally-sized Automated Stacking Cranes (ASCs) working with  ...  Using real world data, we construct test problems varying both the number of container bays and fullness of the block.  ...  They formulate the resulting optimization problem as an integer linear program and solve it using two heuristics.  ... 
doi:10.3934/jimo.2009.5.285 fatcat:cswarlismrhvbfk3qz4eieycua

Service Function Chaining Resource Allocation: A Survey [article]

Yanghao Xie, Zhixiang Liu, Sheng Wang, Yuxiu Wang
2016 arXiv   pre-print
This paper presents a survey of current researches in SFC-RA algorithms. After presenting the formulation and related problems, several variants of SFC-RA problem are summarized.  ...  Service Function Chaining (SFC) is a crucial technology for future Internet. It aims to overcome the limitation of current deployment models which is rigid and static.  ...  [14] present a Mixed Integer Linear Programming (MILP), while Moens and De Turck [15] formulate the problem as an Integer Linear Program (ILP) . Similarly, Gupta et al.  ... 
arXiv:1608.00095v1 fatcat:wc5vkybzrzhfdmnnxvyn7hke4q
« Previous Showing results 1 — 15 out of 1,571 results