LOGISTICS OPTIMIZATION: VEHICLE ROUTING WITH LOADING CONSTRAINTS

Size: px
Start display at page:

Download "LOGISTICS OPTIMIZATION: VEHICLE ROUTING WITH LOADING CONSTRAINTS"

Transcription

1 19 th International Conference on Production Research LOGISTICS OPTIMIZATION: VEHICLE ROUTING WITH LOADING CONSTRAINTS D. Aprile*, J. Egeblad**, A.C. Garavelli*#, S. Lisi*, D. Pisinger** *DIMeG, Politecnico di Bari, Viale Japigia 182, Bari, Italy **DIKU, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen, Denmark # Corresponding author: c.garavelli@poliba.it Tel: Fax: Abstract In today s global markets, enterprises are integrated in order to produce value for the end customers: this network is referred as Supply Chain (SC). Transportation Management (TM) is one of the SC processes. TM decisions include, among others, load planning (referred as Container Loading Problem - CLP) and delivery route planning (referred as Vehicle Routing Problem - VRP). Several authors addressed the delivery optimization which is known ad the. The loading optimization has also been widely studied and is known as the. However, very few papers have dealt with integrated approaches for loading and routing. This paper aiming at providing a link between the two problems. As first, a brief overview of SC and its management are provided, including TM, VRP and CLP issues. Then the developed heuristics for VRP with loading constraints, based on Simulated Annealing, will be introduced and, finally, a solution example will be provided. Keywords: Routing, Loading, Heuristics, Logistics, Distribution, Supply Chain 1 INTRODUCTION 1.1 Supply Chain Management Turbulent environment in today s global markets determines more competitiveness, products life-cycle reduction, increasing customer service level expectations. As a result, enterprises are integrated in a network of agents that are involved in several processes and activities producing value for the end customer: this network is referred to as Supply Chain (SC). Several authors addressed and defined the SC ([1], [2]) Summarizing their definitions, a SC is a coordinated system of agents (typically: suppliers, manufacturers, distributors, and retailers) activities, information and resources (human and material) as well as materials (raw, work-in-process, finished products) and information that encompass the entire SC, involved in moving a product or service from supplier to the end customer, and transforming raw materials and components into a finished product/service. Supply Chain Management (SCM) is the integrated and process-oriented approach to the design, management, and control of the SC, with the aim of producing value for the end customer, by both improving customer service and lowering cost ([3], 4]). SCM mainly involves two classes of managerial problems at different levels: configuration, dealing with the design of the SC at a strategic level, and coordination, concerning the management of the SC network prevalently under tactical and operative levels [5]. According with Simchi-Levi et al [6], SCM encompasses firm s activities at many levels, from strategic trough the tactical to the operational level. The strategic level deals with long term decisions, regarding location, production, inventory, and transportation. The operational level of SC management is concerned with the very short term (day to day) decisions, such as scheduling, lead time, routing and truck loading (transportation issues). 1.2 SC Transportation Management Decisions taken by Transportation Manager System (TMS) often affect other components in the SC network. Considering that, on average, 3.5% of manufacturer s sales costs and 40-60% of total logistics costs are devoted to the movement of products, TM is a crucial issue in today s business environment. Today, companies frequently carry out loading and distribution operations (planning and operative) based on operators experience, without formal optimization (software) aid. This may lead to space waste inside the container or even worse to infeasible loading. A further complication also occurs when a vehicle must serve more than one customer: it is necessary to optimize the delivery route in order to minimize driving distance and unloading work. Several authors have studied delivery optimization which is known ad the Vehicle Routing Problem (VRP). The loading optimization has also been widely studied and is known as the Container Loading Problem (CLP). However, very few papers have dealt with integrated approaches for loading and routing. In the following two subsections, the CLP and the VRP are introduced. Container Loading Problem (CLP) CLP is the problem of loading a subset of rectangular boxes into a rectangular container of fixed dimensions such that the volume of the packed boxes is maximized [7]. Gilmore and Gomory [8] studied the CLP since the middle 1960s and many algorithms, for the solution of the classes of the CLP, had been developed. CLP is a very complex combinatorial problem and, for this reason, an optimal solution (in a reasonable time) does not exist. So, the proposed algorithms are based onto a dynamic programming, a heuristics or a combination of them, achieving a good sub-optimal solution in a

2 reasonable time: a good trade-off for the most of the practical applications. In the literature, several papers describe the algorithms for the solution of the several variants of the CLP. The differences between these variants are: i) the objective function and ii) constraints. Very often, the term container loading has been used as a self-explanatory and complete characterization of the problem [9]. Instead, there are many different practical scenarios, which needed a specific approach. Therefore, that is crucial to identify the CLP variant to face. For this purpose, Pisinger [7] proposes a broad shared classification: Knapsack Loading Problem (KPP): each box has an associated profit, and the problem is to choose a subset of the boxes that fits into a single container so that maximum profit is loaded. Strip Packing Problem (SPP): the container has fixed width and height but infinite depth. The problem is to pack all boxes such that the depth of the container is minimized. Bin Packing Problem (BPP): the stowage of all the items of the charge is required. The problem is to choose a certain number of containers (they all have the same, fixed, dimensions), and all the boxes are to be packed into a minimum number of them, so that the required costs are minimized. Multi-container Loading Problem (MCLP): similar to the Bin-Packing problem but the containers can have different dimensions. Vehicle Routing Problem (VRP) VRP is the determination of the optimal set of routes to be performed by a fleet of vehicle, in order to satisfy the demand of a given set of customers. VRP has been introduced by Dantzig e Ramser in 1959 [10], in its variant CVRP (Capacitated-VRP). Christofides formulated the VRP in VRP includes a class of problems for the determination of the optimal set of routes to be performed by a fleet of vehicles, in order to satisfy the demand of a given set of customers [11]. In its classical formulation, the goal of the VRP is to serve a set of customers, having a known demand, minimizing the transportation cost, starting from a depot, where each vehicle comes back at the end of its route. Several variants of the problem have been formulated and studied and solving algorithms or heuristics have been proposed, but an exact algorithm that is able to solve instance with more than 50 customers does not exist ([12]; [13]. Six simpler variants of the problem can be identified: Pisinger and Ropke [14] make a good classification. They develop a unified heuristics able to solve five different variants of the VRP: CVRP (Capacitated-VRP); MDVRP (Multi Depot-VRP); VRPTW (VRP-Time Window); SDVRP (Side Dependent-VRP); OVRP (Open-VRP). Adding to these, above listed, the simplest routing problem is the travelling Salesman Problem (TSP). One of the best-known problem is the CVRP. It is the problem to deliver goods to a set of customers with known demands on minimum-cost vehicle routes originating and terminating at a depot. The vehicles are homogeneous and with the same capacity. CVRP is another vocabulary of the m-tsp, where the cities are customers and the salesmen are vehicles. The difference respect m-tsp is the vehicle capacity Q and the demand q i of customer i (i = 1,,n). The mathematical formulation is very close to the TSP, and has been formulated by many authors, [15], using a set partitioning approach. The input data for solving the CVRP are various: travel and delivery time, costs, distances, etc These data can be obtained by mathematical approximated computation or using intelligent system like GIS (Geographic Information System). VRP-CLP interaction Sometimes, routing and packing (loading) goals are in conflict. The cost structure must take into account the packing features and issues as well as the travel ones. One of the most relevant variants of CLP is the so-called Strip Packing Problem (SPP). The SPP is often strictly related to another variant of the CLP: the Bin Packing Problem (BPP). The BPP is easily extendable in order to consider bins with different shape and dimensions. The SPP lies at the interception with the other logistic delivery problem considered in this research: the Vehicle Routing Problem (VRP), i.e. the determination of the optimal set of routes to be performed by a fleet of vehicle, in order to satisfy the demand of a given set of customers, given a central depot [11]. In spite of the two issues (CLP and VRP) have been large studied in the literature, there are a few closely-related references that have addressed the link between them, and anyone has weakly or never considered the loading of three dimensional, complex items, like sofas for instance. 1.3 Annealing technique Simulated annealing is a meta-heuristic technique based on the analogy between the physic process of the cooling solid material process and the combinatorial problem solution. In physics, the cooling solid material process consists in immersing the material in a heat bath, increasing the bath temperature up to its melting point, in correspondence of which the material particles are randomly distributed. Then the bath temperature is decreased slowly, allowing the achieving of the heat stability at each temperature, cooling back the material into a solid state. It is interesting notice that the structural properties at the end of the cooling process depend by the rate of cooling: if the temperature decreases too fast, the results will be a crystal with many imperfections. In the early 1953, Metropolis et al. [16] developed an algorithm that simulated the cooling schedule of material in a heat bath. Starting from an initial state S, with a temperature T, a perturbation is generated (at each temperature t) in order to reach a new state S and the energy variation is calculated. If the variation moves in the direction of the objective function improvement, the solution will be accepted, otherwise it could be accepted according with a probability function. The algorithm runs a certain number of iterations at each temperature and then the temperature is decreased until it achieves the value at which the system is frozen in a steady state. In the early 1980s, Kirkpatrick et al. [17] extended the use of simulated annealing to a wide range of optimization problem.

3 19 th International Conference on Production Research 2 PRELIMINARY CONSIDERATIONS The outbound logistics (delivery) problem is addressed developing a heuristics which, considering a set of customer orders, find a feasible loading solution (at least one) and ensuring the feasibility of the proposed routes, minimizing the total delivering cost. The model of analysis is a Capacitated Vehicle Routing Problem (CVRP) with three-dimensional loading constraints. Therefore, it encompasses both VRP and CLP. Often, the routing optimization is static : for each customer is a-priori defined the service mode (point-topoint, groupage, direct-to-unload, etc ). Therefore, each customer is considering lying on a pre-defined path or, at least, each one belongs to a specific area and no optimization of routing is made during the optimization referring to the SPP and BPP. This could lead to an inefficient optimization. The developing 3L-CVRP heuristics has the aim to address the route optimization in a dynamic way : customers don t belong to a predefined route/container but are assigned to the route while optimization process runs. Figure 1 an instance with 1 depot and n customers Considering a single depot instance (Figure 1), the heuristics try to is aiming at finding a set of vehicle routes of minimal total cost, starting and ending at a depot, such that every customer is visited exactly once by one vehicle. The items demanded are furnishings (in particular sofas with different shapes) to be loaded into containers (a 40ft container is considered as transport mean without loss of generality) and delivered to the customers. This assumption is particularly remarkable because the loading items have features weakly or never considered in the literature. In the following subsections, the features of the problem arising from the assumption to solve the VRP from a furnishing company are described. Then, a mathematical formulation of the problem is explained. 2.1 Furnishing company loading and delivery features The loading and delivery problem for a furnishing company has features that have been weakly or never considered in the literature: Since sofas and armchairs have irregular shapes, they are usually coupled in order to create cuboids rectangular arrangements (pairings); but since the shapes can be very different, and the items are not rigid in the strong sense, some squeezing occur, making hard a prediction of the pairings. Each possible arrangement is constituted by two or more sofas and has different dimensions for each other. Arrangement dimensions can be modified with regard to the available space: sliding between the items are allowed. Generally, sofas and armchairs are loaded in a vertical direction to avoid structural problems and yielding. From a loading operation point of view, three main problems emerge: Loading Optimization, Graphic-geometric item representation; Pairing simulation between different loading items. In order to solve the problem, three software preprototypes have been developed, using C++ language: Constructor module: it is merely a filter between the real dimensions of a sofa and the input data (sections, their coordinates) for the pairing module. Inserting a certain number of measures, every loading items can be modelled. Pair module: it builds pairing between two generic sofas, allowing several slidings, calculating the three dimensions (width, height, depth) of the resulting pairing. Packer module: it is the core of the optimization process. Starting from a loading mix (i.e., a possible mix of sofas to be loaded), given the dimensions of all the possible pairing, it makes the loading optimization. For the VRP solution, the problem cannot stop here. When customers orders must be grouped together, loaded into a transport mean and delivered (Strip Packing problem), all the features and issues related to VRP rise up and the problem complexity increases. In addition, one must consider some loading constraints. A feasible solution to the full problem is a VRP that also satisfies these packing constraints, which provide the link between the routing and packing problems. Often, furnishing companies make the delivery optimization using experience of planning and loading operator, just counting up to a certain number of seats (the seat is the unit of measure: 1 chair = 1 seat) but without any optimization, inferring several different risks: infeasibility of cargo (it could be impossible to load all the items into the transport mean), space waste (a transport mean could have a lot of empty space); the routes are not optimized. VRP instances can be extremely difficult to solve in practice. So, a heuristic algorithm implementation (Router module) has been added. 3 THE MODEL OF ANALYSIS 3.1 Working hypotheses The goal of the proposed model is to develop and implement a heuristics that links the CLP and VRP. The problem is to deliver the demanded cargo to the shops from a single depot, to minimize the overall travel distances. Assuming that the transportation problem only has a single constraint (the dimensional capacity of the vehicle), the problem is very close to the Capacitated Vehicle Routing Problem (CVRP). The retailers collect the demands of several customers geographically distributed and emit orders to the upstream stages of the SC. In each retailer, K identical vehicles, with dimensions W, L and a specific height H, are available to serve n customers, each one demands a certain number of sofas and furnishings of different shapes and dimensions. The vehicles have a three-dimensional loading volume. The aim is to find K routes of minimum cost, taking into account the capacity and dimensional constraints of the vehicles and finding a feasible allocation of the items inside them, such that the individual deliveries are ordered in a vehicle and all items to deliver to a customer can be unloaded without moving items to the other customers. Therefore, all the items belonging to a customer must be loaded closely one to each other.

4 So, the problem can be considered as a 3L-CVRP where 3L means three-dimensional loading constrained, and link CLP and VRP. Therefore, the problem is NP-hard in the strong sense. Since the problem is NP-hard it is often desirable to obtain approximate solutions, so they can be found fast enough and are sufficiently accurate for the purpose. 3.2 Heuristics description In a three-dimensional-capacitated VRP, a given route (starting at the depot, visiting the customers c 1, c 2, c n, ending at the depot) must be feasible. Hence, it will be tested if the packing chart is feasible. The heuristics is composed by three parts: pre-computing of loading of the items demanded by each customer; matching pre-computation of the possible pairing (it will be clearly explained in the following); simulated annealing for solving VRP. Loading pre-computation In the loading pre-computation, the approach is the one typical of SPP, with the aim to pack all the items of each customer separately into the container (vehicle) minimizing the used volume of the packing (Figure 2a). Due to the intrinsic hardness of three-dimensional (3D) packing, it is impossible to expect to check feasibility of a packing in every step of the algorithm, in reasonable time. Instead, as far as possible, the heuristics pre-computes the loading of each customer, giving as an output of the two-dimensional (2D) packing of a certain number (from 5 to 10) good packing solutions. For this purpose, the loading modules (Constructor, Pair and, in particular, Packer) are employed. Using the item models built with Constructor module, the Packer module allows a 3D loading and returns a 2D packing projection, which will be used by the VRP solver, of an ideal customer order, made by several items of different shape and dimensions, as shown in Figure 2-a. In the loading pre-computation, each set of items (belonging to a customer) is packed at the end of the container. Therefore, here are considered only particular structures of loading having three flat sides and a split line contour on the fourth side. The container surface is defined as a positive quadrant of a Cartesian coordinate system in which the origin (0, 0) is the bottom-left corner and the x-axis and the y-axis are the right and the bottom sides, respectively, of the loading surface (Figure 2-b). Figure 2 loading pre-computation for a single customer The coordinates of its four points define the position of the packed set p i contour, as follows (Figure 3): The heuristics will get as an output not only the optimal solution (minimal area), but also a certain number (5-10, at the most) other good solutions (p i) encountered during the search. Matching computation Before applying the CVRP heuristics, complexity can be reduced by evaluating all the pairing data between the customer orders, i.e. the packed set p i and p j of each couple of customers. In fact, this way each couple of customer orders results in a wall, because one side of the packed set p i is flat by construction. Looking at Figure 3, let (x i1, y i1), (x i2, y i2), (x i3, y i3), (x i4, y i4), and (x j1, y j1), (x j2, y j2), (x j3, y j3), (x j4, y j4) the coordinates of the packed sets p i and p j, respectively. Figure 3 packing set loading representation First, the length of the pairing p ij depends by the joint type. In fact, in mathematics: if (y j4 - y j3 ) y i3 then length (p ij) = x i4 + x j4; else (i.e., the joint is like in Figure 4) length (p ij) = max {(x i4 + x j1); (x i1 + x j4)}; Once the length (p ij) has been evaluated for each couple of customers and for each possible pairing (considering all the 5-10 good solutions of the pre-loading computation), will set p ij,min = min {length (p ij)}. Figure 4 matching computation example The aim is to pre-compute the best pair (minimum total depth) achievable by each possible pairing p ij, between the packed sets p i and p j of each couple of customers, considering all the good solutions obtained in the previous phase. All these minimum pairings will be stored into a Matching Table that will be used as an input for the VRP solver. VRP solver The first two phases reduce the complexity of the problem so this phase addresses a classical CVRP with dimensional constraint. The underlying problem is a classical CVRP. A graph G(V,E), where V is a set of n+1 vertices, corresponding to the depot d (vertex 0) and to the customers (vertices 1,.,n), is here considered. A set of K identical bins (container) is available at the depot. Anyway, a VRP instance could be solved employing just a subset Z K of bins. Each one has a parallelepiped-loading surface, accessible only form one side (loading/unloading operations), whose width, height is equal to the couple (W, L) as shown in Figure 3. For each edge (i,j) E a arc travelling cost c ij is defined. The aim is to find a set of vehicle routes of minimal total cost, starting and ending at a depot, such that every customer is visited exactly once by one vehicle. The first step of the VRP heuristics is to find an initial solution. Without loss of generality, one can imagine to dispatch one vehicle to each customer if it is possible (otherwise, one can imagine using as much as possible vehicles).

5 19 th International Conference on Production Research According to Iori et al. [11], a feasible route is made by a couple r = (S, σ) where S is a subset of customers and σ is a bijection σ : S {1,., S }, such that σ(i) is the position of a customer along the route. Once it finds a route r, heuristics checks it feasibility, trying to load the customer packing set p i (σ(i) r) in a forward and reverse mode, ensuring that the sum of the lengths of the packing set pairings does not exceed the vehicle length L (1). p ij,min < L i, j r In order to explain the difference between forward and reverse mode, one can consider the following example (Figure 5). Considering the same set of customers and their packing sets, the forward route (Depot-c 1-c 2-c 3) is not feasible because the total length of the packed set is greater than the vehicle length L. On the contrary, the reverse route (Depot-c 3-c 2-c 1 ) is feasible. Figure 5 an example of feasible/not feasible route Considering a cost per Km travelled by a vehicle (Km_cost) and a cost per vehicle rent (vehicle_cost), the objective function is the following: min( r R (1) Km_cost r + vehicle_cost z) (2) z Z where R is the set of routes r that solve the instance and z identify a vehicle of Z employed of the fleet K. The heuristics is based on Simulated Annealing. The reason why annealing metaheuristics has been chosen for the implementation is because it appears as one of the best performing heuristics for VRP and it is used by Pisinger and Ropke [2005] for the ALNS algorithm. Moreover, local search could constrain the solution in a local minimum valley, while others (e.g. Genetic algorithms) generally have a bad performance, because they need to maintain a population of (often same) solutions. The heuristic algorithm in each iteration replaces the current solution by a random "nearby" solution, chosen with a probability that depends on the difference between the corresponding function values and on a global parameter T (called the temperature), that is gradually decreased during the process. The heuristics tries to reduce the total costs reducing the numbers of used vehicles, by randomly selecting one customer of the route r i, and moving it to the route r j. Then, the temperature is decreased according with the pre-defined cooling schedule. The heuristics works until the stopping criterion is satisfied. 4 RESULTS 4.1 Heuristics Tuning In analogy with physics, a control parameter (called temperature ) decreases at each step. The cooling function adopted is the geometric reduction α(t) = αt, with α<1. The choice of α is very important for the convergence of the heuristics and it depends by the other parameter. Referring to the annealing algorithm described in the previous sections, the stopping condition is the reaching of the final temperature T f at the most with nrep iterations. Since t i+1 = αt i, it is trivial to prove that T f = α nrep * T 0, so T nrep f α = (3) T0 It is clear it depends by the other cooling schedule parameters. Firstly, the number of iteration has been fixed to nrep = 10,000, according with a value that is widely used in practices and ensuring a computational time around one minute on a Pentium IV with 256 MB RAM and Genuine Intel 2.30 GHz processor. The value of final temperature must be around zero, to ensure that the probability of accepting of a worse solution will be zero at the end of the cooling process: T f = Once fixed those two values (nrep and T f), the value of α depends only by the initial temperature T 0. In order to ensure that a certain number of worse solutions are accepted in the first 10% (1,000) iterations, the cooling schedules from cs7 (T 0 = 10) to cs13 (T 0 = 1,000) have been considered. 4.2 Simulations Simulations have been conduced considering 50 realistic (the demanded item are really sofas built with the Constructor software module) instances: 10 with 10 customers; 10 with 20 customers; 10 with 25 customers; 10 with 50 customers; 10 with 100 customers. Each instance has been simulated with all the selected cooling schedules, setting Km_cost = 1 and vehicle_cost = 1,000 in the objective function. The sum of Km covered by a vehicle is variable; so the total Km_cost is variable, too. A fixed cost due to the vehicle rent (often companies refers to third logistics) must be considered for each route. It is three times greater (in order size) than Km_cost, for emphasizing the inefficiency due to a rent of a vehicle for covering a few kilometres and/or wasting space inside it (e.g., a vehicle with only a few number of loaded items). The average value of the objective functions of each group of instances (whit 10, 20, 50, 100 customers) has been measured, for each cooling schedule (Table 1). Results have shown the minimum value depends by the number of customers of the instance, according with Simulated Annealing theory. In particular, the start temperature T 0 seems to be in inverse proportion to the number of customers of the instance. Table 1 cooling schedule tuning Cooling schedule STARTTEMP (T 0) customers customers customers COST customers customers

6 4.3 An example An instance with 10 customers has been solved, using the VRP solver heuristics. Router software module is used to solve the VRP optimization, using the cooling schedule with start temperature T 0 =1,000 (the best average value one). The solution reported in Figure 6-a is found in 4.31 sec. (3.86 for the CLP and 0.45 for the VRP) and it shows both the VRP routes and the CLP packing solution. The system proposes the cost for each route (e.g., for the vehicle 0, 1425 in Figure 6-a, where 1000 is the vehicle cost and 425 the route cost) and the total one. Furthermore, the packing solution can be also shown in three-dimensional representation (Figure 6-b). Figure 6 graphical solution proposed 5 CONCLUSIONS The 3L-CVRP allows to reach a fast solution (from 4.5 to 20 seconds for instances with 10 to 25 customers; around 35 seconds for instances with 50 customers; around 90 seconds for instances with 100 customers) for the VRP with loading constraints, ensuring both routing and loading feasibility. A higher number of iteration allows a very good solution for small instances. In fact, with small instances the initial temperature is high and the probability of acceptance of worse solutions at the beginning is high too. Therefore, simulated annealing is exploited as much as possible, allowing an almost full exploration of the solution space. On the contrary, starting from a lower initial temperature, the probability of acceptance decreases at the beginning and a broad exploration of solution space is not allowed. Anyway, since time fast solution requirement is needed, the heuristics is able to solve small and large instances in reasonable time, ensuring feasibility of loading and routing contemporaneously. Further developments of this study seem to be promising. Developing a better greedy heuristics would improve the solution quality. Another improvement could be made to address a multiple depot VRP, introducing more flexibility in customer orders aggregation. This could lead to consideration about the performance of configuration flexibility also for the final stage of the SC. Then, time windows service could be implemented, taking into account delivery times required by customers. [4] Giannoccaro I., Pontrandolfo P., 2002, Inventory Management in Supply Chains: a Reinforcement Learning Approach, International Journal of Production Economics, Vol. 78, No. 2, pp [5] Giannoccaro, I., Pontrandolfo, P., 2001, Models for Supply Chain Management: a Taxonomy, Proceedings of the POM-2001 Conference: POM Mastery in the New Millennium, March 30-April 2, Orlando, Florida. [6] Simchi-Levi D., Kaminsky P, Simchi-Levi E., 2000, Designing and Managing the Supply Chain, McGraw-Hill, printed in Singapore. [7] Pisinger, D., 2002, Heuristics for the Container Loading Problem, European Journal of Operational Research, pp [8] Gilmore, P.C., Gomory, R.E., 1965, Multistage Cutting Problems of Two and More Dimensions, Operational Research 13, pp [9] Bischoff E.E., Janetz F., Ratcliff M.S.W., 1995, Loading pallets with non-identical items, European Journal of Operational, Vol. 84, pp [10] Dantzig, G.B., Ramser, R.H., 1959, The truck dispatching problem, Management Science 6, pp [11] Iori M., Salazar Gonzalez J.J., Vigo D., 2005, An exact approach for vehicle routing problem with twodimensional loading constraints. Transportation Science accepted for publication. [12] Golden, B. and Assad, A., Eds. 1998, Vehicle Routing: Methods and Studies, North-Holland, Amsterdam. [13] Naddef, D., Rinaldi, G., 2002, Branch-and-Cut Algorithms for the VRP. In The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp [14] Pisinger D., Ropke S., 2005, A General Heuristics for Vehicle Routing Problems, Technical Report, Datalogisk Institute Kobenhavn Universitet (DIKU), Denmark. [15] Toth P., Vigo D., 2002, The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia. [16] Metropolis N., Rosenbluth A.W., Rosenbluth M.N., Teller A.H., Teller E., 1953, Equation of State Calculation by Fast Computing Machines, J. of Chem. Phys., 21, pp [17] Kirkpatrick S., Gellat C.D., Vecchi M.P., 1983, Optimization by Simulated Annealing, Science, 220, pp REFERENCES [1] Lee H. L., Billington C., 1995, The Evolution of Supply-Chain-Management Models and Practice at Hewlett-Packard. Interfaces 25 (pp.42-63): 5 September-October. [2] Christopher, M., 1992, Logistic and Supply Chain Management, Pitman Publishing, London. [3] Bowersox D.J., Closs D. J., 1996, Logistics Management: The Integrated Supply Chain Process, McGraw-Hill.

Research Paper Business Analytics. Applications for the Vehicle Routing Problem. Jelmer Blok

Research Paper Business Analytics. Applications for the Vehicle Routing Problem. Jelmer Blok Research Paper Business Analytics Applications for the Vehicle Routing Problem Jelmer Blok Applications for the Vehicle Routing Problem Jelmer Blok Research Paper Vrije Universiteit Amsterdam Faculteit

More information

Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows

Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows TECHNISCHE UNIVERSITEIT EINDHOVEN Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows Lloyd A. Fasting May 2014 Supervisors: dr. M. Firat dr.ir. M.A.A. Boon J. van Twist MSc. Contents

More information

Solving the Vehicle Routing Problem with Multiple Trips by Adaptive Memory Programming

Solving the Vehicle Routing Problem with Multiple Trips by Adaptive Memory Programming Solving the Vehicle Routing Problem with Multiple Trips by Adaptive Memory Programming Alfredo Olivera and Omar Viera Universidad de la República Montevideo, Uruguay ICIL 05, Montevideo, Uruguay, February

More information

VEHICLE ROUTING AND SCHEDULING PROBLEMS: A CASE STUDY OF FOOD DISTRIBUTION IN GREATER BANGKOK. Kuladej Panapinun and Peerayuth Charnsethikul.

VEHICLE ROUTING AND SCHEDULING PROBLEMS: A CASE STUDY OF FOOD DISTRIBUTION IN GREATER BANGKOK. Kuladej Panapinun and Peerayuth Charnsethikul. 1 VEHICLE ROUTING AND SCHEDULING PROBLEMS: A CASE STUDY OF FOOD DISTRIBUTION IN GREATER BANGKOK By Kuladej Panapinun and Peerayuth Charnsethikul Abstract Vehicle routing problem (VRP) and its extension

More information

Fifty Years of Vehicle Routing

Fifty Years of Vehicle Routing Fifty Years of Vehicle Routing by Gilbert Laporte Canada Research Chair in Distribution Management HEC Montréal Vehicle Routing Problem Depot m (or at most m) identical vehicles based at the depot n customers

More information

Cost Models for Vehicle Routing Problems. 8850 Stanford Boulevard, Suite 260 R. H. Smith School of Business

Cost Models for Vehicle Routing Problems. 8850 Stanford Boulevard, Suite 260 R. H. Smith School of Business 0-7695-1435-9/02 $17.00 (c) 2002 IEEE 1 Cost Models for Vehicle Routing Problems John Sniezek Lawerence Bodin RouteSmart Technologies Decision and Information Technologies 8850 Stanford Boulevard, Suite

More information

Heuristic and exact algorithms for vehicle routing problems. Stefan Ropke

Heuristic and exact algorithms for vehicle routing problems. Stefan Ropke Heuristic and exact algorithms for vehicle routing problems Stefan Ropke December 2005 Preface This Ph.D. thesis has been prepared at the Department of Computer Science at the University of Copenhagen

More information

Solving a New Mathematical Model for a Periodic Vehicle Routing Problem by Particle Swarm Optimization

Solving a New Mathematical Model for a Periodic Vehicle Routing Problem by Particle Swarm Optimization Transportation Research Institute Iran University of Science and Technology Ministry of Science, Research and Technology Transportation Research Journal 1 (2012) 77-87 TRANSPORTATION RESEARCH JOURNAL www.trijournal.ir

More information

Memory Allocation Technique for Segregated Free List Based on Genetic Algorithm

Memory Allocation Technique for Segregated Free List Based on Genetic Algorithm Journal of Al-Nahrain University Vol.15 (2), June, 2012, pp.161-168 Science Memory Allocation Technique for Segregated Free List Based on Genetic Algorithm Manal F. Younis Computer Department, College

More information

A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem

A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem Sayedmohammadreza Vaghefinezhad 1, Kuan Yew Wong 2 1 Department of Manufacturing & Industrial Engineering, Faculty of Mechanical

More information

Solving the Vehicle Routing Problem with Genetic Algorithms

Solving the Vehicle Routing Problem with Genetic Algorithms Solving the Vehicle Routing Problem with Genetic Algorithms Áslaug Sóley Bjarnadóttir April 2004 Informatics and Mathematical Modelling, IMM Technical University of Denmark, DTU Printed by IMM, DTU 3 Preface

More information

Chapter 1. Introduction

Chapter 1. Introduction Chapter 1 Introduction Intermodal freight transportation describes the movement of goods in standardized loading units (e.g., containers) by at least two transportation modes (rail, maritime, and road)

More information

VEHICLE ROUTING PROBLEM

VEHICLE ROUTING PROBLEM VEHICLE ROUTING PROBLEM Readings: E&M 0 Topics: versus TSP Solution methods Decision support systems for Relationship between TSP and Vehicle routing problem () is similar to the Traveling salesman problem

More information

Two objective functions for a real life Split Delivery Vehicle Routing Problem

Two objective functions for a real life Split Delivery Vehicle Routing Problem International Conference on Industrial Engineering and Systems Management IESM 2011 May 25 - May 27 METZ - FRANCE Two objective functions for a real life Split Delivery Vehicle Routing Problem Marc Uldry

More information

The Trip Scheduling Problem

The Trip Scheduling Problem The Trip Scheduling Problem Claudia Archetti Department of Quantitative Methods, University of Brescia Contrada Santa Chiara 50, 25122 Brescia, Italy Martin Savelsbergh School of Industrial and Systems

More information

A Binary Model on the Basis of Imperialist Competitive Algorithm in Order to Solve the Problem of Knapsack 1-0

A Binary Model on the Basis of Imperialist Competitive Algorithm in Order to Solve the Problem of Knapsack 1-0 212 International Conference on System Engineering and Modeling (ICSEM 212) IPCSIT vol. 34 (212) (212) IACSIT Press, Singapore A Binary Model on the Basis of Imperialist Competitive Algorithm in Order

More information

Metaheuristics for the consistent nurse scheduling and routing problem.

Metaheuristics for the consistent nurse scheduling and routing problem. Metaheuristics for the consistent nurse scheduling and routing problem. Thomas Macdonald supervisors: Karl Dörner and Xavier Gandibleux Department of Production and Logistics University of Vienna Bruenner

More information

New Exact Solution Approaches for the Split Delivery Vehicle Routing Problem

New Exact Solution Approaches for the Split Delivery Vehicle Routing Problem New Exact Solution Approaches for the Split Delivery Vehicle Routing Problem Gizem Ozbaygin, Oya Karasan and Hande Yaman Department of Industrial Engineering, Bilkent University, Ankara, Turkey ozbaygin,

More information

A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem

A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem Campos,V., Corberán, A., Mota, E. Dep. Estadística i Investigació Operativa. Universitat de València. Spain Corresponding author:

More information

An Efficient Algorithm for Solving a Stochastic Location-Routing Problem

An Efficient Algorithm for Solving a Stochastic Location-Routing Problem Journal of mathematics and computer Science 12 (214) 27 38 An Efficient Algorithm for Solving a Stochastic LocationRouting Problem H.A. HassanPour a, M. MosadeghKhah a, M. Zareei 1 a Department of Industrial

More information

School Timetabling in Theory and Practice

School Timetabling in Theory and Practice School Timetabling in Theory and Practice Irving van Heuven van Staereling VU University, Amsterdam Faculty of Sciences December 24, 2012 Preface At almost every secondary school and university, some

More information

An optimisation framework for determination of capacity in railway networks

An optimisation framework for determination of capacity in railway networks CASPT 2015 An optimisation framework for determination of capacity in railway networks Lars Wittrup Jensen Abstract Within the railway industry, high quality estimates on railway capacity is crucial information,

More information

Agenda. Real System, Transactional IT, Analytic IT. What s the Supply Chain. Levels of Decision Making. Supply Chain Optimization

Agenda. Real System, Transactional IT, Analytic IT. What s the Supply Chain. Levels of Decision Making. Supply Chain Optimization Agenda Supply Chain Optimization KUBO Mikio Definition of the Supply Chain (SC) and Logistics Decision Levels of the SC Classification of Basic Models in the SC Logistics Network Design Production Planning

More information

TRANSPORT PLANNING IN CONDITIONS OF DIFFERENT TRANSPORT TARIFFS APPLICATION OF INTEGER PROGRAMMING

TRANSPORT PLANNING IN CONDITIONS OF DIFFERENT TRANSPORT TARIFFS APPLICATION OF INTEGER PROGRAMMING TOTAL LOGISTIC MANAGEMENT No. 1 2008 PP. 25 31 Paweł HANCZAR TRANSPORT PLANNING IN CONDITIONS OF DIFFERENT TRANSPORT TARIFFS APPLICATION OF INTEGER PROGRAMMING Abstract: This paper presents the application

More information

Revenue Management for Transportation Problems

Revenue Management for Transportation Problems Revenue Management for Transportation Problems Francesca Guerriero Giovanna Miglionico Filomena Olivito Department of Electronic Informatics and Systems, University of Calabria Via P. Bucci, 87036 Rende

More information

Local Search Algorithms for Vehicle Routing Problems of a Chain of Convenience Stores

Local Search Algorithms for Vehicle Routing Problems of a Chain of Convenience Stores Journal of Industrial and Intelligent Information Vol. 3, No. 3, September 2015 Local Search Algorithms for Vehicle Routing Problems of a Chain of Convenience Stores Yuwadee Prakaiphetkul and Pisut Pongchairerks

More information

Project Management Simulation Environment for Participant-Centered Learning

Project Management Simulation Environment for Participant-Centered Learning Education and Practice Research Statement Dr LEE Wee Leong School of Information Systems, Singapore Management University Tel: (65) 6828-0937; Email: wllee@smu.edu.sg 13 Jan 2015 Background My educational

More information

Parallel Simulated Annealing Algorithm for Graph Coloring Problem

Parallel Simulated Annealing Algorithm for Graph Coloring Problem Parallel Simulated Annealing Algorithm for Graph Coloring Problem Szymon Łukasik 1, Zbigniew Kokosiński 2, and Grzegorz Świętoń 2 1 Systems Research Institute, Polish Academy of Sciences, ul. Newelska

More information

A Programme Implementation of Several Inventory Control Algorithms

A Programme Implementation of Several Inventory Control Algorithms BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume, No Sofia 20 A Programme Implementation of Several Inventory Control Algorithms Vladimir Monov, Tasho Tashev Institute of Information

More information

Load Building and Route Scheduling

Load Building and Route Scheduling Load Building and Route Scheduling for SAP ERP Optimization Excellence Advanced 3D Load Building and Dynamic Route Scheduling Designed for use with SAP ERP Maximize your SAP ERP capabilities for shipping

More information

The QOOL Algorithm for fast Online Optimization of Multiple Degree of Freedom Robot Locomotion

The QOOL Algorithm for fast Online Optimization of Multiple Degree of Freedom Robot Locomotion The QOOL Algorithm for fast Online Optimization of Multiple Degree of Freedom Robot Locomotion Daniel Marbach January 31th, 2005 Swiss Federal Institute of Technology at Lausanne Daniel.Marbach@epfl.ch

More information

Using Ant Colony Optimization for Infrastructure Maintenance Scheduling

Using Ant Colony Optimization for Infrastructure Maintenance Scheduling Using Ant Colony Optimization for Infrastructure Maintenance Scheduling K. Lukas, A. Borrmann & E. Rank Chair for Computation in Engineering, Technische Universität München ABSTRACT: For the optimal planning

More information

Strategic Planning and Vehicle Routing Algorithm for Newspaper Delivery Problem: Case study of Morning Newspaper, Bangkok, Thailand

Strategic Planning and Vehicle Routing Algorithm for Newspaper Delivery Problem: Case study of Morning Newspaper, Bangkok, Thailand Strategic Planning and Vehicle Routing Algorithm for Newspaper Delivery Problem: Case study of Morning Newspaper, Bangkok, Thailand Arunya Boonkleaw, Nanthi Sutharnnarunai, PhD., Rawinkhan Srinon, PhD.

More information

A Tool For Active FLEET Management and Analysis of Activities of a Snow PlowING and a Road Salting Fleet

A Tool For Active FLEET Management and Analysis of Activities of a Snow PlowING and a Road Salting Fleet A Tool For Active FLEET Management and Analysis Activities a Snow PlowING and a Road Salting Fleet Rok Strašek, Tina Vukasović Abstract - Current economic crisis combined with increasing fuel costs rises

More information

Waste Collection Vehicle Routing Problem Considering Similarity Pattern of Trashcan

Waste Collection Vehicle Routing Problem Considering Similarity Pattern of Trashcan International Journal of Applied Operational Research Vol. 3, o. 3, pp. 105-111, Summer 2013 Journal homepage: www.ijorlu.ir Waste Collection Vehicle Routing Problem Considering Similarity Pattern of Trashcan

More information

Dynamic programming. Doctoral course Optimization on graphs - Lecture 4.1. Giovanni Righini. January 17 th, 2013

Dynamic programming. Doctoral course Optimization on graphs - Lecture 4.1. Giovanni Righini. January 17 th, 2013 Dynamic programming Doctoral course Optimization on graphs - Lecture.1 Giovanni Righini January 1 th, 201 Implicit enumeration Combinatorial optimization problems are in general NP-hard and we usually

More information

A CENTROID-BASED HEURISTIC ALGORITHM FOR THE CAPACITATED VEHICLE ROUTING PROBLEM

A CENTROID-BASED HEURISTIC ALGORITHM FOR THE CAPACITATED VEHICLE ROUTING PROBLEM Computing and Informatics, Vol. 30, 2011, 721 732 A CENTROID-BASED HEURISTIC ALGORITHM FOR THE CAPACITATED VEHICLE ROUTING PROBLEM Kwangcheol Shin Department of Computer Science Korea Advanced Institute

More information

Genetic Algorithm. Based on Darwinian Paradigm. Intrinsically a robust search and optimization mechanism. Conceptual Algorithm

Genetic Algorithm. Based on Darwinian Paradigm. Intrinsically a robust search and optimization mechanism. Conceptual Algorithm 24 Genetic Algorithm Based on Darwinian Paradigm Reproduction Competition Survive Selection Intrinsically a robust search and optimization mechanism Slide -47 - Conceptual Algorithm Slide -48 - 25 Genetic

More information

Transportation. Transportation decisions. The role of transportation in the SC. A key decision area within the logistics mix

Transportation. Transportation decisions. The role of transportation in the SC. A key decision area within the logistics mix Transportation A key decision area within the logistics mix Chapter 14 Transportation in the Supply Chain Inventory Strategy Forecasting Storage decisions Inventory decisions Purchasing & supply planning

More information

INSY 4970/7970/7976 Vehicle Routing & Logistics Spring 2014

INSY 4970/7970/7976 Vehicle Routing & Logistics Spring 2014 INSY 4970/7970/7976 Vehicle Routing & Logistics Spring 2014 Instructor: E-mail: Office: Office Hours: Dr. Chase Murray All e-mail communication will be handled via Canvas. 3301F Shelby (See Canvas) Teaching

More information

Real-Life Vehicle Routing with Non-Standard Constraints

Real-Life Vehicle Routing with Non-Standard Constraints , July 3-5, 203, London, U.K. Real-Life Vehicle Routing with n-standard Constraints W. L. Lee Abstract Real-life vehicle routing problems comprise of a number of complexities that are not considered by

More information

Software Framework for Vehicle Routing Problem with Hybrid Metaheuristic Algorithms

Software Framework for Vehicle Routing Problem with Hybrid Metaheuristic Algorithms Software Framework for Vehicle Routing Problem with Hybrid Metaheuristic Algorithms S.MASROM 1, A.M. NASIR 2 Malaysia Institute of Transport (MITRANS) Faculty of Computer and Mathematical Science Universiti

More information

Practical Guide to the Simplex Method of Linear Programming

Practical Guide to the Simplex Method of Linear Programming Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear

More information

Airport logistics - A case study of the turnaround

Airport logistics - A case study of the turnaround Airport logistics - A case study of the turnaround process Anna Norin, Tobias Andersson Granberg, Di Yuan and Peter Värbrand Linköping University Post Print N.B.: When citing this work, cite the original

More information

HYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE

HYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE HYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE Subodha Kumar University of Washington subodha@u.washington.edu Varghese S. Jacob University of Texas at Dallas vjacob@utdallas.edu

More information

Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture - 36 Location Problems In this lecture, we continue the discussion

More information

MATHEMATICAL ENGINEERING TECHNICAL REPORTS. The Best-fit Heuristic for the Rectangular Strip Packing Problem: An Efficient Implementation

MATHEMATICAL ENGINEERING TECHNICAL REPORTS. The Best-fit Heuristic for the Rectangular Strip Packing Problem: An Efficient Implementation MATHEMATICAL ENGINEERING TECHNICAL REPORTS The Best-fit Heuristic for the Rectangular Strip Packing Problem: An Efficient Implementation Shinji IMAHORI, Mutsunori YAGIURA METR 2007 53 September 2007 DEPARTMENT

More information

Evaluation of Different Task Scheduling Policies in Multi-Core Systems with Reconfigurable Hardware

Evaluation of Different Task Scheduling Policies in Multi-Core Systems with Reconfigurable Hardware Evaluation of Different Task Scheduling Policies in Multi-Core Systems with Reconfigurable Hardware Mahyar Shahsavari, Zaid Al-Ars, Koen Bertels,1, Computer Engineering Group, Software & Computer Technology

More information

each college c i C has a capacity q i - the maximum number of students it will admit

each college c i C has a capacity q i - the maximum number of students it will admit n colleges in a set C, m applicants in a set A, where m is much larger than n. each college c i C has a capacity q i - the maximum number of students it will admit each college c i has a strict order i

More information

Models and algorithms for solving packing problems in logistics

Models and algorithms for solving packing problems in logistics Models and algorithms for solving packing problems in logistics DISSERTATION FOR THE DEGREE OF DOCTOR OF COMPUTER SCIENCE TO BE PRESENTED WITH DUE PERMISSION OF THE DEPARTMENT OF COMPUTER SCIENCE, FOR

More information

Improving Forestry Transport Efficiency through Truck Schedule Optimization: a case study and software tool for the Australian Industry

Improving Forestry Transport Efficiency through Truck Schedule Optimization: a case study and software tool for the Australian Industry Improving Forestry Transport Efficiency through Truck Schedule Optimization: a case study and software tool for the Australian Industry Mauricio Acuna Harvesting and Operations Program CRC for Forestry

More information

A Set-Partitioning-Based Model for the Stochastic Vehicle Routing Problem

A Set-Partitioning-Based Model for the Stochastic Vehicle Routing Problem A Set-Partitioning-Based Model for the Stochastic Vehicle Routing Problem Clara Novoa Department of Engineering and Technology Texas State University 601 University Drive San Marcos, TX 78666 cn17@txstate.edu

More information

Complexity Theory. IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar

Complexity Theory. IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar Complexity Theory IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar Outline Goals Computation of Problems Concepts and Definitions Complexity Classes and Problems Polynomial Time Reductions Examples

More information

A Reactive Tabu Search for Service Restoration in Electric Power Distribution Systems

A Reactive Tabu Search for Service Restoration in Electric Power Distribution Systems IEEE International Conference on Evolutionary Computation May 4-11 1998, Anchorage, Alaska A Reactive Tabu Search for Service Restoration in Electric Power Distribution Systems Sakae Toune, Hiroyuki Fudo,

More information

SELECTED ASPECTS OF TRANSPORTATION SYSTEM MODELLING

SELECTED ASPECTS OF TRANSPORTATION SYSTEM MODELLING TOTAL LOGISTIC MANAGEMENT No. 1 2008 PP. 15 24 Tomasz AMBROZIAK, Dariusz PYZA SELECTED ASPECTS OF TRANSPORTATION SYSTEM MODELLING Abstract: The paper presents selected aspects of the transport services

More information

Modeling and Solving the Capacitated Vehicle Routing Problem on Trees

Modeling and Solving the Capacitated Vehicle Routing Problem on Trees in The Vehicle Routing Problem: Latest Advances and New Challenges Modeling and Solving the Capacitated Vehicle Routing Problem on Trees Bala Chandran 1 and S. Raghavan 2 1 Department of Industrial Engineering

More information

A Library of Vehicle Routing Problems

A Library of Vehicle Routing Problems A Library of Vehicle Routing Problems Tim Pigden and Optrak Distribution Software Ltd. Tim.Pigden@optrak.com Graham Kendall and The University of Nottingham Malaysia Campus Jalan Broga, 43500 Semenyih

More information

Metaheuristics in Vehicle Routing

Metaheuristics in Vehicle Routing Metaheuristics in Vehicle Routing Michel Gendreau CIRRELT and MAGI École Polytechnique de Montréal Vilamoura, Portugal, 4-6 February 2012 Presentation outline 1) Vehicle Routing Problems 2) Metaheuristics

More information

Optimal Scheduling for Dependent Details Processing Using MS Excel Solver

Optimal Scheduling for Dependent Details Processing Using MS Excel Solver BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 8, No 2 Sofia 2008 Optimal Scheduling for Dependent Details Processing Using MS Excel Solver Daniela Borissova Institute of

More information

Model, Analyze and Optimize the Supply Chain

Model, Analyze and Optimize the Supply Chain Model, Analyze and Optimize the Supply Chain Optimize networks Improve product flow Right-size inventory Simulate service Balance production Optimize routes The Leading Supply Chain Design and Analysis

More information

A Tool for Generating Partition Schedules of Multiprocessor Systems

A Tool for Generating Partition Schedules of Multiprocessor Systems A Tool for Generating Partition Schedules of Multiprocessor Systems Hans-Joachim Goltz and Norbert Pieth Fraunhofer FIRST, Berlin, Germany {hans-joachim.goltz,nobert.pieth}@first.fraunhofer.de Abstract.

More information

Charles Fleurent Director - Optimization algorithms

Charles Fleurent Director - Optimization algorithms Software Tools for Transit Scheduling and Routing at GIRO Charles Fleurent Director - Optimization algorithms Objectives Provide an overview of software tools and optimization algorithms offered by GIRO

More information

5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1

5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition

More information

Scheduling Algorithm with Optimization of Employee Satisfaction

Scheduling Algorithm with Optimization of Employee Satisfaction Washington University in St. Louis Scheduling Algorithm with Optimization of Employee Satisfaction by Philip I. Thomas Senior Design Project http : //students.cec.wustl.edu/ pit1/ Advised By Associate

More information

Measuring the Performance of an Agent

Measuring the Performance of an Agent 25 Measuring the Performance of an Agent The rational agent that we are aiming at should be successful in the task it is performing To assess the success we need to have a performance measure What is rational

More information

Vehicle Routing: Transforming the Problem. Richard Eglese Lancaster University Management School Lancaster, U.K.

Vehicle Routing: Transforming the Problem. Richard Eglese Lancaster University Management School Lancaster, U.K. Vehicle Routing: Transforming the Problem Richard Eglese Lancaster University Management School Lancaster, U.K. Transforming the Problem 1. Modelling the problem 2. Formulating the problem 3. Changing

More information

Optimization of recyclable waste collection using real-time information.

Optimization of recyclable waste collection using real-time information. 6th International Conference on Industrial Engineering and Industrial Management. XVI Congreso de Ingeniería de Organización. Vigo, July 18-20, 2012 Optimization of recyclable waste collection using real-time

More information

International Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS) www.iasir.net

International Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS) www.iasir.net International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Emerging Technologies in Computational

More information

Minimizing the Carbon Footprint for the Time-Dependent Heterogeneous-Fleet Vehicle Routing Problem with Alternative Paths

Minimizing the Carbon Footprint for the Time-Dependent Heterogeneous-Fleet Vehicle Routing Problem with Alternative Paths Sustainability 2014, 6, 4658-4684; doi:10.3390/su6074658 Article OPEN ACCESS sustainability ISSN 2071-1050 www.mdpi.com/journal/sustainability Minimizing the Carbon Footprint for the Time-Dependent Heterogeneous-Fleet

More information

Linear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.

Linear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc. 1. Introduction Linear Programming for Optimization Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc. 1.1 Definition Linear programming is the name of a branch of applied mathematics that

More information

Dynamic programming formulation

Dynamic programming formulation 1.24 Lecture 14 Dynamic programming: Job scheduling Dynamic programming formulation To formulate a problem as a dynamic program: Sort by a criterion that will allow infeasible combinations to be eli minated

More information

The Multi-Item Capacitated Lot-Sizing Problem With Safety Stocks In Closed-Loop Supply Chain

The Multi-Item Capacitated Lot-Sizing Problem With Safety Stocks In Closed-Loop Supply Chain International Journal of Mining Metallurgy & Mechanical Engineering (IJMMME) Volume 1 Issue 5 (2013) ISSN 2320-4052; EISSN 2320-4060 The Multi-Item Capacated Lot-Sizing Problem Wh Safety Stocks In Closed-Loop

More information

An Improved ACO Algorithm for Multicast Routing

An Improved ACO Algorithm for Multicast Routing An Improved ACO Algorithm for Multicast Routing Ziqiang Wang and Dexian Zhang School of Information Science and Engineering, Henan University of Technology, Zheng Zhou 450052,China wzqagent@xinhuanet.com

More information

University of British Columbia Co director s(s ) name(s) : John Nelson Student s name

University of British Columbia Co director s(s ) name(s) : John Nelson Student s name Research Project Title : Truck scheduling and dispatching for woodchips delivery from multiple sawmills to a pulp mill Research Project Start Date : September/2011 Estimated Completion Date: September/2014

More information

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation

More information

Analysis of Various Forecasting Approaches for Linear Supply Chains based on Different Demand Data Transformations

Analysis of Various Forecasting Approaches for Linear Supply Chains based on Different Demand Data Transformations Institute of Information Systems University of Bern Working Paper No 196 source: https://doi.org/10.7892/boris.58047 downloaded: 16.11.2015 Analysis of Various Forecasting Approaches for Linear Supply

More information

Largest Fixed-Aspect, Axis-Aligned Rectangle

Largest Fixed-Aspect, Axis-Aligned Rectangle Largest Fixed-Aspect, Axis-Aligned Rectangle David Eberly Geometric Tools, LLC http://www.geometrictools.com/ Copyright c 1998-2016. All Rights Reserved. Created: February 21, 2004 Last Modified: February

More information

Adaptive Memory Programming for the Vehicle Routing Problem with Multiple Trips

Adaptive Memory Programming for the Vehicle Routing Problem with Multiple Trips Adaptive Memory Programming for the Vehicle Routing Problem with Multiple Trips Alfredo Olivera, Omar Viera Instituto de Computación, Facultad de Ingeniería, Universidad de la República, Herrera y Reissig

More information

Unifying the Private Fleet with Purchased Transportation

Unifying the Private Fleet with Purchased Transportation Unifying the Private Fleet with Purchased Transportation Achieving Lower Costs and Higher Service via Dynamic, Omni-Mode Integration of Private Fleet with For Hire Operations Sponsored by: The Descartes

More information

The Problem of Scheduling Technicians and Interventions in a Telecommunications Company

The Problem of Scheduling Technicians and Interventions in a Telecommunications Company The Problem of Scheduling Technicians and Interventions in a Telecommunications Company Sérgio Garcia Panzo Dongala November 2008 Abstract In 2007 the challenge organized by the French Society of Operational

More information

A New Approach for Finite Capacity Planning in MRP Environment

A New Approach for Finite Capacity Planning in MRP Environment A New Approach for Finite Capacity Planning in MRP Environment Hong-bum Na 1, Hyoung-Gon Lee 1, and Jinwoo Park 1 1 Dept. of Industrial Engeering / Automation & Systems Research Inst. Seoul National University

More information

FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM

FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM International Journal of Innovative Computing, Information and Control ICIC International c 0 ISSN 34-48 Volume 8, Number 8, August 0 pp. 4 FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT

More information

Nurse Rostering. Jonathan Johannsen CS 537. Scheduling Algorithms

Nurse Rostering. Jonathan Johannsen CS 537. Scheduling Algorithms Nurse Rostering Jonathan Johannsen CS 537 Scheduling Algorithms Most hospitals worldwide create schedules for their staff by hand, spending hours trying to optimally assign workers to various wards at

More information

Strategic planning in LTL logistics increasing the capacity utilization of trucks

Strategic planning in LTL logistics increasing the capacity utilization of trucks Strategic planning in LTL logistics increasing the capacity utilization of trucks J. Fabian Meier 1,2 Institute of Transport Logistics TU Dortmund, Germany Uwe Clausen 3 Fraunhofer Institute for Material

More information

Design and Analysis of ACO algorithms for edge matching problems

Design and Analysis of ACO algorithms for edge matching problems Design and Analysis of ACO algorithms for edge matching problems Carl Martin Dissing Söderlind Kgs. Lyngby 2010 DTU Informatics Department of Informatics and Mathematical Modelling Technical University

More information

A Learning Based Method for Super-Resolution of Low Resolution Images

A Learning Based Method for Super-Resolution of Low Resolution Images A Learning Based Method for Super-Resolution of Low Resolution Images Emre Ugur June 1, 2004 emre.ugur@ceng.metu.edu.tr Abstract The main objective of this project is the study of a learning based method

More information

ALWAYS ON THE RIGHT PATH. Optimized planning and dispatch with SyncroTESS

ALWAYS ON THE RIGHT PATH. Optimized planning and dispatch with SyncroTESS ALWAYS ON THE RIGHT PATH Optimized planning and dispatch with SyncroTESS FAST REACTION PROACTIVE SUPPORT Always on top of the business: Every 30 to 120 seconds SyncroTESS produces an up-to-date schedule

More information

Using simulation to calculate the NPV of a project

Using simulation to calculate the NPV of a project Using simulation to calculate the NPV of a project Marius Holtan Onward Inc. 5/31/2002 Monte Carlo simulation is fast becoming the technology of choice for evaluating and analyzing assets, be it pure financial

More information

An Improvement Technique for Simulated Annealing and Its Application to Nurse Scheduling Problem

An Improvement Technique for Simulated Annealing and Its Application to Nurse Scheduling Problem An Improvement Technique for Simulated Annealing and Its Application to Nurse Scheduling Problem Young-Woong Ko, DongHoi Kim, Minyeong Jeong, Wooram Jeon, Saangyong Uhmn and Jin Kim* Dept. of Computer

More information

A PRELIMINARY INFORMATION MODEL FOR A SUPPLY CHAIN SIMULATION

A PRELIMINARY INFORMATION MODEL FOR A SUPPLY CHAIN SIMULATION A PRELIMINARY INFORMATION MODEL FOR A SUPPLY CHAIN SIMULATION Y. Tina Lee 1, Charles McLean 1, Shigeki Umeda 2 1 National Institute of Standards and Technology, Gaithersburg, MD 20899-8260, USA {leet,

More information

Un algorithme génétique hybride à gestion adaptative de diversité pour le problème de tournées de véhicules et ses variantes

Un algorithme génétique hybride à gestion adaptative de diversité pour le problème de tournées de véhicules et ses variantes Un algorithme génétique hybride à gestion adaptative de diversité pour le problème de tournées de véhicules et ses variantes Thibaut VIDAL LOSI et CIRRELT Université de Technologie de Troyes et Université

More information

4.2 Description of the Event operation Network (EON)

4.2 Description of the Event operation Network (EON) Integrated support system for planning and scheduling... 2003/4/24 page 39 #65 Chapter 4 The EON model 4. Overview The present thesis is focused in the development of a generic scheduling framework applicable

More information

Evaluation of Complexity of Some Programming Languages on the Travelling Salesman Problem

Evaluation of Complexity of Some Programming Languages on the Travelling Salesman Problem International Journal of Applied Science and Technology Vol. 3 No. 8; December 2013 Evaluation of Complexity of Some Programming Languages on the Travelling Salesman Problem D. R. Aremu O. A. Gbadamosi

More information

A CP Scheduler for High-Performance Computers

A CP Scheduler for High-Performance Computers A CP Scheduler for High-Performance Computers Thomas Bridi, Michele Lombardi, Andrea Bartolini, Luca Benini, and Michela Milano {thomas.bridi,michele.lombardi2,a.bartolini,luca.benini,michela.milano}@

More information

Dynamic Vehicle Routing in MATSim

Dynamic Vehicle Routing in MATSim Poznan University of Technology Department of Motor Vehicles and Road Transport ZPSiTD Dynamic Vehicle Routing in MATSim Simulation and Optimization Michal Maciejewski michal.maciejewski@put.poznan.pl

More information

2004 Networks UK Publishers. Reprinted with permission.

2004 Networks UK Publishers. Reprinted with permission. Riikka Susitaival and Samuli Aalto. Adaptive load balancing with OSPF. In Proceedings of the Second International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET

More information

Agents Towards Vehicle Routing Problems

Agents Towards Vehicle Routing Problems Agents Towards Vehicle Routing Problems Jiří Vokřínek Agent Technology Center Czech Technical University in Prague vokrinek@agents.felk.cvut.cz Antonín Koma Agent Technology Center Czech Technical University

More information

Performance Optimization of I-4 I 4 Gasoline Engine with Variable Valve Timing Using WAVE/iSIGHT

Performance Optimization of I-4 I 4 Gasoline Engine with Variable Valve Timing Using WAVE/iSIGHT Performance Optimization of I-4 I 4 Gasoline Engine with Variable Valve Timing Using WAVE/iSIGHT Sean Li, DaimlerChrysler (sl60@dcx dcx.com) Charles Yuan, Engineous Software, Inc (yuan@engineous.com) Background!

More information

INTRUSION PREVENTION AND EXPERT SYSTEMS

INTRUSION PREVENTION AND EXPERT SYSTEMS INTRUSION PREVENTION AND EXPERT SYSTEMS By Avi Chesla avic@v-secure.com Introduction Over the past few years, the market has developed new expectations from the security industry, especially from the intrusion

More information

Solving Simultaneous Equations and Matrices

Solving Simultaneous Equations and Matrices Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for considering

More information