A new methodology for constructing convex optimization models called disciplined convex programming is introduced. The methodology enforces a set of conventions upon the models constructed, in turn allowing much of the work required to analyze and solve the models to be automated.

/pdf/disciplined-convex-programming-46i3cp8qhe.pdf

Disciplined Convex Programming

Integer programming formulations of discrete hub location problems

https://www.repository.cam.ac.uk/bitstream/1810/280260/1/Geissdoerfer%20et%20al.%202018_Author%27s%20version.pdf

Business models and supply chains for the circular economy

Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches.- Connections in Networks: Hardness of Feasibility Versus Optimality.- Modeling the Regular Constraint with Integer Programming.- Hybrid Local Search for Constrained Financial Portfolio Selection Problems.- The "Not-Too-Heavy Spanning Tree" Constraint.- Eliminating Redundant Clauses in SAT Instances.- Cost-Bounded Binary Decision Diagrams for 0-1 Programming.- YIELDS: A Yet Improved Limited Discrepancy Search for CSPs.- A Global Constraint for Total Weighted Completion Time.- Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method.- Necessary Condition for Path Partitioning Constraints.- A Constraint Programming Approach to the Hospitals / Residents Problem.- Best-First AND/OR Search for 0/1 Integer Programming.- A Position-Based Propagator for the Open-Shop Problem.- Directional Interchangeability for Enhancing CSP Solving.- A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production.- Replenishment Planning for Stochastic Inventory Systems with Shortage Cost.- Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search.- The Deviation Constraint.- The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width.- On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint.- Solving a Stochastic Queueing Control Problem with Constraint Programming.- Constrained Clustering Via Concavity Cuts.- Bender's Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem.- A Large Neighborhood Search Heuristic for Graph Coloring.- Generalizations of the Global Cardinality Constraint for Hierarchical Resources.- A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems.

Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007 : proceedings

Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics. Using large neighborhoods makes it possible to find better candidate solutions in each iteration and hence traverse a more promising search path. Starting from the large neighborhood search method, we give an overview of very large scale neighborhood search methods and discuss recent variants and extensions like variable depth search and adaptive large neighborhood search.

/pdf/large-neighborhood-search-11l8tr3ez0.pdf

Large Neighborhood Search

Supply chain network design (SCND) models and methods have been the subject of several recent literature review surveys, but none of them explicitly includes sustainable development as a main characteristic of the problem considered. The aim of this review is to bridge this gap. The paper analyzes 87 papers in the field of supply chain network design, covering mathematical models that include economic factors as well as environmental and/or social dimensions. The review is organized along four research questions asking (i) which environmental and social objectives are included, (ii) how are they integrated into the models, (iii) which methods and tool are used and finally (iv) which industrial applications and contexts are covered in these models. The review finds that there are a number of limitations to the current research in sustainable SCND. The narrow scope of environmental and social measures in current models should go beyond limited greenhouse gas indicators to broader life-cycle approaches including new social metrics. The more effective inclusion of uncertainty and risk in models with improved multi-objective approaches is also needed. There are also significant gaps in the sectors used to test models limiting more general applicability. The paper concludes with promising new avenues of research to more effectively include sustainability into SCND models.

/pdf/sustainable-supply-chain-network-design-an-optimization-42wek3gyel.pdf

Sustainable supply chain network design: An optimization-oriented review☆

A dynamic model for facility location in the design of complex supply chains

The pickup and delivery problem PDP consists in defining a set of routes that satisfy transportation requests between a set of pickup points and a set of delivery points. This paper addresses a variant of the PDP where requests can change vehicle during their trip. The transfer is made at specific locations called “transfer points.” The corresponding problem is called the pickup and delivery problem with transfers PDPT. Solving the PDPT leads to new modeling and algorithmic difficulties. We propose new heuristics capable of efficiently inserting requests through transfer points. These heuristics are embedded into an adaptive large neighborhood search. We evaluate the method on generated instances and apply it to the transportation of people with disabilities. On these real-life instances we show that the introduction of transfer points can bring significant improvements up to 9% to the value of the objective function.

An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers

https://hal.archives-ouvertes.fr/hal-01068305/document

Optimization of a city logistics transportation system with mixed passengers and goods

https://hal.archives-ouvertes.fr/hal-00818800/document

Olivier Péton

Papers

Sustainable supply chain network design: An optimization-oriented review☆

A dynamic model for facility location in the design of complex supply chains

An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers

Optimization of a city logistics transportation system with mixed passengers and goods

The Dial-A-Ride Problem with Transfers