Search Results - subject:"Integer Programming"

Containership scheduling with transit-time-sensitive container shipment demand

Wang, Shuaian; Meng, Qiang; Liu, Zhiyuan - In: Transportation Research Part B: Methodological 54 (2013) C, pp. 68-83

This paper examines the optimal containership schedule with transit-time-sensitive demand that is assumed to be a decreasing continuous function of transit time. A mixed-integer nonlinear non-convex optimization model is first formulated to maximize the total profit of a ship route. In view of...

Persistent link: https://www.econbiz.de/10011065501

The time-dependent pollution-routing problem

Franceschetti, Anna; Honhon, Dorothée; Van Woensel, Tom; … - In: Transportation Research Part B: Methodological 56 (2013) C, pp. 265-293

The Time-Dependent Pollution-Routing Problem (TDPRP) consists of routing a fleet of vehicles in order to serve a set of customers and determining the speeds on each leg of the routes. The cost function includes emissions and driver costs, taking into account traffic congestion which, at peak...

Persistent link: https://www.econbiz.de/10011065511

The Dotted-Board Model: A new MIP model for nesting irregular shapes

Toledo, Franklina M.B.; Carravilla, Maria Antónia; … - In: International Journal of Production Economics 145 (2013) 2, pp. 478-487

The nesting problem, also known as irregular packing problem, belongs to the generic class of cutting and packing (C&P) problems. It differs from other 2-D C&P problems in the irregular shape of the pieces. This paper proposes a new mixed-integer model in which binary decision variables are...

Persistent link: https://www.econbiz.de/10011043261

Two-dimensional strip packing problem with load balancing, load bearing and multi-drop constraints

Queiroz, Thiago A. de; Miyazawa, Flávio K. - In: International Journal of Production Economics 145 (2013) 2, pp. 511-530

In the oriented Two-Dimensional Strip Packing Problem (2SP), one has to pack a set of rectangular items into a rectangular strip and minimizes the overall strip height used to pack all items. This paper deals with the 2SP under two practical situations. In the first, feasible packings must...

Persistent link: https://www.econbiz.de/10011043285

Minimising the total weighted tardiness for non-identical parallel batch processing machines with job release times and non-identical job sizes

Chou, Fuh-Der - In: European Journal of Industrial Engineering 7 (2013) 5, pp. 529-557

. A mixed integer programming (MIP) model is formulated, and a multi-MIP approach is proposed based on this model. Given …

Persistent link: https://www.econbiz.de/10010722755

Lower and upper bounds for location-arc routing problems with vehicle capacity constraints

Doulabi, Hashemi; Hossein, Seyed; Seifi, Abbas - In: European Journal of Operational Research 224 (2013) 1, pp. 189-208

programming models are presented for single and multi-depot problems. Relaxing these formulations leads to other integer …This paper addresses multi-depot location arc routing problems with vehicle capacity constraints. Two mixed integer … programming models whose solutions provide good lower bounds for the total cost. A powerful insertion heuristic has been developed …

Persistent link: https://www.econbiz.de/10010580811

Aggregate-level demand management in evacuation planning

Bish, Douglas R.; Sherali, Hanif D. - In: European Journal of Operational Research 224 (2013) 1, pp. 79-92

Without successful large-scale regional evacuations, threats such as hurricanes and wild-fires can cause a large loss of life. In this context, automobiles are oftentimes an essential transportation mode for evacuations, but the ensuing traffic typically overwhelms the roadway capacity and...

Persistent link: https://www.econbiz.de/10010580813

Optimising a nonlinear utility function in multi-objective integer programming

Ozlen, Melih; Azizoğlu, Meral; Burton, Benjamin - In: Journal of Global Optimization 56 (2013) 1, pp. 93-102

integer programming. We develop a general optimisation algorithm for use with k objectives, and we illustrate our approach … using a tri-objective integer programming problem. Copyright Springer Science+Business Media, LLC. 2013 …

Persistent link: https://www.econbiz.de/10010994116

A cutting plane algorithm for the Capacitated Connected Facility Location Problem

Gollowitzer, Stefan; Gendron, Bernard; Ljubić, Ivana - In: Computational Optimization and Applications 55 (2013) 3, pp. 647-674

refer to it as the Capacitated Connected Facility Location Problem. We develop a basic integer programming model based on …

Persistent link: https://www.econbiz.de/10010998376

An efficient compact quadratic convex reformulation for general integer quadratic programs

Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie - In: Computational Optimization and Applications 54 (2013) 1, pp. 141-162

We address the exact solution of general integer quadratic programs with linear constraints. These programs constitute a particular case of mixed-integer quadratic programs for which we introduce in Billionnet et al. (Math. Program., <CitationRef CitationID="CR3">2010</CitationRef>) a general solution method based on quadratic convex...</citationref>

Persistent link: https://www.econbiz.de/10010998387