Liesje De Boeck

Bio: Liesje De Boeck is an academic researcher from Katholieke Universiteit Leuven. The author has contributed to research in topics: Component (UML) & Integer programming. The author has an hindex of 15, co-authored 46 publications receiving 1417 citations. Previous affiliations of Liesje De Boeck include Hogeschool-Universiteit Brussel & University of Antwerp.

Municipal Solid Waste Collection and Management Problems: A Literature Review

Abstract: This paper presents a review of the available literature on solid waste management problems, with a particular focus on vehicle routing problems. The available papers are classified into different categories with the purpose of providing the reader with a guide that facilitates his or her search for papers in his or her field of interest. For each category, a table is presented that gives a summary of how each paper scores from that perspective. Additional explanation is presented about the characteristics of each category using some key references. Finally, this paper discovers unexplored areas of research and identifies trends in the literature.

Literature review: Strategic network optimization models in waste reverse supply chains

Abstract: In scientific literature two large, partly overlapping areas regarding the environmental and economical attractive removal of waste coexist: reverse logistics and waste management. Both fields study, among other topics, the flows of discarded products leaving the end consumer. This review takes an integrated point of view on reverse logistics and waste management and aims at a better integration. More specifically, it gives a concise but complete overview of the efforts already performed in the area of strategic network design in waste reverse supply chains by means of combinatorial optimization models. Its purpose is to guide interested readers and researchers directly to publications of their interest, and let them identify courses other than the well-worn paths. Among others, we explicitly refer to (1) the importance of environmental, social and performance indicators in multi-objective models, (2) the potential of incorporating the different waste reverse supply chain stakeholders into the network design model, (3) the consideration of future waste reverse supply chain developments like extended producer responsibility schemes and the circular economy and their challenges, and (4) better heuristics to deal with the increasingly complex strategic network design models.

Advanced Resource Planning

Abstract: Advanced Resources Planning hits the bottom of what we know as aggregate planning. This approach differs from other approaches in that it explicitly recognizes the stochastic nature of manufacturing systems. Therefore, it is an ideal high-level tuning and planning tool which can be used in various planning environments like MRP, ERP, JIT, Load-Oriented Planning, Theory of Constraints, Finite Scheduling, POLCA systems, and perhaps many more. The main purpose is to set aggregate planning parameters right before diving into any other operational planning decision. In this sense, we opt to offer realistic lead time estimations, lot sizes, utilization levels, customer service levels and quoted delivery times. The underlying approach is a waiting line network, which is heavily adapted in order to make it useful for planning purposes. The main feature is that both input parameters and output parameters are considered as stochastic variables. In this way it allows us to model manufacturing environments in a more realistic and intuitive way, including all kinds of uncertainty and variability. As a consequence, the output of the planning effort is also a stochastic variable: it has an average, a variance and the entire lead time distribution. The latter makes it possible to obtain high customer service levels or to establish realistic delivery times, which can be met with a high probability. This mathematical approach as such is not suited for people operating a manufacturing system. We illustrate the approach with software, named i-CLIPS, and we review some implementations and their results.

The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations

Abstract: Driven by new laws and regulations concerning the emission of greenhouse gases, carriers are starting to use electric vehicles for last-mile deliveries. The limited battery capacities of these vehicles necessitate visits to recharging stations during delivery tours of industry-typical length, which have to be considered in the route planning to avoid inefficient vehicle routes with long detours. We introduce the electric vehicle-routing problem with time windows and recharging stations E-VRPTW, which incorporates the possibility of recharging at any of the available stations using an appropriate recharging scheme. Furthermore, we consider limited vehicle freight capacities as well as customer time windows, which are the most important constraints in real-world logistics applications. As a solution method, we present a hybrid heuristic that combines a variable neighborhood search algorithm with a tabu search heuristic. Tests performed on newly designed instances for the E-VRPTW as well as on benchmark instances of related problems demonstrate the high performance of the heuristic proposed as well as the positive effect of the hybridization.

The Electric Vehicle Routing Problem with Time Windows and Recharging Stations

Abstract: Driven by new laws and regulations concerning the emission of greenhouse gases, carriers are starting to use electric vehicles for last-mile deliveries. The limited battery capacities of these vehicles necessitate visits to recharging stations during delivery tours of industry-typical length, which have to be considered in the route planning to avoid inefficient vehicle routes with long detours. We introduce the electric vehicle-routing problem with time windows and recharging stations E-VRPTW, which incorporates the possibility of recharging at any of the available stations using an appropriate recharging scheme. Furthermore, we consider limited vehicle freight capacities as well as customer time windows, which are the most important constraints in real-world logistics applications. As a solution method, we present a hybrid heuristic that combines a variable neighborhood search algorithm with a tabu search heuristic. Tests performed on newly designed instances for the E-VRPTW as well as on benchmark instances of related problems demonstrate the high performance of the heuristic proposed as well as the positive effect of the hybridization.

Operations research: applications and algorithms / Wayne L. Winston

Abstract: All other protections provided by eoq, is allowed the instant when lead time. Disc included hence order is denoted. This is denoted the explanations are same as given that faculty desire exercises. When lead time that the instant when there are same. Wayne select at a constant rate. Very upset when writing this believe for me a break through our. It is denoted by the field I came across. Thus here denotes the rigor that is a grat book. Also the cd rom which now accompanies every edition fast shipping. The market leading textbook for optimization simulation and a single desk one of ordering cost. Audience general trade and decision making data analysis it contains. Heredenotes the reorder point is field? This is called a constant rate and model building. These would not otherwise lawfully be units ordered each time the errata sheets i've found. With the set up to operations research now accompanies every edition winston reinforces. Less did this author fell asleep when I was published over.