The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The purpose of this paper is to introduce the area of Green Logistics and to describe some of the problems that arise in this subject which can be formulated as combinatorial optimization problems. The paper particularly considers the topics of reverse logistics, waste management and vehicle routing and scheduling.
Across many industries, e-commerce generates substantial modifications in supply chain structures. The aim of this article is to assess different forms of existing organizations when a store-based sales network coexists with a web site order network. Three main organizational models can be detected: “store-picking”, “dedicated warehouse-picking” and “drop-shipping”. We use a “newsboy” order policy...
The application of multi-attribute utility theory based on the Choquet integral requires the prior identification of a capacity if the utility scale is unipolar, or of a bi-capacity if the utility scale is bipolar. In order to implement a minimum distance principle for capacity or bi-capacity approximation or identification, quadratic distances between capacities and bi-capacities are studied. The...
This is a summary of the main contributions of the author’s PhD thesis. The thesis is written in English. It was supervised by Philippe Vincke and was defended on 20 December 2005 at the Université Libre de Bruxelles. A copy is available from the author upon request. The aim of this work is to investigate the use of a partial relations for bids’ comparisons in the context of multi-attribute auctions...
This text summarizes the PhD thesis defended by the author in January 2006 under the supervision of Professor Erik Demeulemeester at the Katholieke Universiteit Leuven. The thesis is written in English and is available from the author’s website (http://www.econ.kuleuven.be/jeroen.belien). In this research we propose a number of exact and heuristic algorithms for various scheduling problems encountered...
We present an overview of the author’s Ph.D. thesis, supervised by P. Dejax and N. Bostel, which was defended in February 2006 at École des Mines de Nantes, France. The thesis is written in French, and is available at http://www.tel.ccsd.cnrs.fr/tel-00078905/ . It was conducted in the context of a research contract with a water distribution company. In a first section, we define multiperiod routing...
We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0–1 mixed-integer problems subject to assignment constraints. The resulting linearized formulation is more compact and tighter than that obtained with a more usual linearization technique. We discuss the application of the compact linearization to...
The Generalized Nash equilibrium problem is an important model that has its roots in the economic sciences but is being fruitfully used in many different fields. In this survey paper we aim at discussing its main properties and solution algorithms, pointing out what could be useful topics for future research in the field.
This text summarizes the results related to Operations research contained in the PhD thesis defended by the author in June 2006 under the supervision of Karel Soudan at the Universiteit Antwerpen in Belgium. The thesis is written in English and is available from the author upon request (Reniers in shaping an integrated cluster safety culture in the chemical process industry, 415 p, 2006a). This work...
New types of optimization problems are faced by the generating companies that operate on deregulated electricity markets. The characteristics of these problems depend on the various market structures. In the framework of the recently settled Italian electricity market, one of these new problems is the transition from hourly energy programs, defined by the market, to more detailed power generation...
Optimising routing of vehicles constitutes a major logistic stake in many industrial contexts. We are interested here in the optimal resolution of special cases of vehicle routing problems, known as team orienteering problems. In these problems, vehicles are guided by a reward that can be collected from customers, while the length of routes is limited. The main difference with classical vehicle routing...
This text summarizes the PhD thesis of Robert Boute, obtained at the Katholieke Universiteit Leuven (Belgium) under supervision of Marc Lambrecht. This doctoral dissertation in the field of Supply Chain Management demonstrates that significant cost reductions can be obtained for both the retailer and the manufacturer when they align their replenishment policy. Such a collaboration strategy goes far...
We review the recent book authored by David L. Applegate, Robert E. Bixby, Vasěk Chvátal and William J. Cook, The traveling salesman problem: a computational study, Princeton Series in Applied Mathematics. Princeton University Press 2007, Hardback price $45.00 / £26.95, 606pp, ISBN 978-0-691-12993-8.
The capacitated vehicle routing problem (CVRP) is the problem in which a set of identical vehicles located at a central depot is to be optimally routed to supply customers with known demands subject to vehicle capacity constraints. This paper provides a review of the most recent developments that had a major impact in the current state-of-the-art of exact algorithms for the CVRP. The most important...
The obnoxious p-median (OpM) problem is the repulsive counterpart of the ore known attractive p-median problem. Given a set I of cities and a set J of possible locations for obnoxious plants, a p-cardinality subset Q of J is sought, such that the sum of the distances between each city of I and the nearest obnoxious site in Q is maximised. We formulate (OpM) as a {0,1} linear programming problem and...
This is a summary of the main results presented in the author’s Ph.D thesis, available at http://prodhonc.free.fr/homepage. This thesis, written in French, was supervised by Christian Prins and Roberto Wolfler-Calvo, and defended on 16 October 2006 at the Université de Technologie de Troyes. Several new approaches are proposed to solve the capacitated location-routing problem (CLRP): heuristic, cooperative...
The purpose of this paper is to illustrate the diversity of combinatorial problems encountered in the design of wireless switching systems. This is done via a representative selection of examples of real problems along with their associated solution methods. It should be emphasized that all the solution methods presented in this paper are successfully operating in the field at the time of writing.
This is a summary of the author’s PhD thesis. The thesis, written in English, was defended on 6 March 2006, and was supervised by Rik Van Landeghem and Claude Van Mechelen. A copy is available from the author upon request. This PhD thesis focuses on (cost-)efficient quality control for multistage production processes, a major issue to manufacturers. Subjecting a larger product fraction to inspection,...
This is a summary of the author’s PhD thesis supervised by Frits Spieksma and defended on 20 December 2006 at the Katholieke Universiteit Leuven. The thesis is written in English and is available from the author’s website (http://www.econ.kuleuven.be/dries.goossens/public). This work deals with combinatorial auctions, i.e., auctions where bidders can bid on sets of items. We study two special cases,...
This is a summary of the author’s PhD thesis supervised by Marie- Christine Costa and Frédéric Roupin and defended on 20 November 2006 at the Conservatoire National des Arts et Métiers in Paris (France). The thesis is written in French and is available upon request from the author. This work deals with two well-known optimization problems from graph theory: the maximum integral multiflow and the minimum...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.