12,879 research outputs found
Using group role assignment to solve Dynamic Vehicle Routing Problem
The Dynamic Vehicle Routing Problem (DVRP) is a more complex problem than the traditional
Vehicle Routing Problem (VRP) in the combinatorial optimization of operations research. With
more degrees of freedom, DVRP introduces new challenges while judging the merit of a given
route plan.
This thesis utilized the time slice strategy to solve dynamic and deterministic routing
problems. Based on Group Role Assignment (GRA) and two different routing methods (Modified
Insertion heuristic routing and Modified Composite Pairing Or-opt routing), a new ridesharing
system has been designed to provide services in the real world.
Simulation results are presented in this thesis. A qualitative comparison has been made to
outline the advantages and performance of our solution framework. From the numerical results,
the proposed method has a great potential to put into operation in the real world and provides a
new transit option for the public.Master of Science (MSc) in Computational Scienc
ASAP: The After Salesman Problem
The customer contacts taking place after a sales transaction and the services involved are of increasing importance in contemporary business models. The responsiveness to service requests is a key dimension in service quality and therefore an important succes factor in this business domain. This responsiveness is of course highly dependent on the operational scheduling or dispatching decisions made in the often dynamic service settings. We consider the problem of optimizing responsiveness to service requests arriving in real time. We consider three models and formulations and present computational results on exact solution methods. The research is based on practical practical work done with the largest service organization in The Netherlands.operations research and management science;
The two-echelon capacitated vehicle routing problem: models and math-based heuristics
Multiechelon distribution systems are quite common in supply-chain and logistics. They are used by public administrations in their transportation and traffic planning strategies, as well as by companies, to model own distribution systems. In the literature, most of the studies address issues relating to the movement of flows throughout the system from their origins to their final destinations. Another recent trend is to focus on the management of the vehicle fleets required to provide transportation among different echelons. The aim of this paper is twofold. First, it introduces the family of two-echelon vehicle routing problems (VRPs), a term that broadly covers such settings, where the delivery from one or more depots to customers is managed by routing and consolidating freight through intermediate depots. Second, it considers in detail the basic version of two-echelon VRPs, the two-echelon capacitated VRP, which is an extension of the classical VRP in which the delivery is compulsorily delivered through intermediate depots, named satellites. A mathematical model for two-echelon capacitated VRP, some valid inequalities, and two math-heuristics based on the model are presented. Computational results of up to 50 customers and four satellites show the effectiveness of the methods developed
Optimisation of Mobile Communication Networks - OMCO NET
The mini conference âOptimisation of Mobile Communication Networksâ focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University.
The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing
Design and Control of Warehouse Order Picking: a literature review
Order picking has long been identified as the most labour-intensive and costly activity for almost every warehouse; the cost of order picking is estimated to be as much as 55% of the total warehouse operating expense. Any underperformance in order picking can lead to unsatisfactory service and high operational cost for its warehouse, and consequently for the whole supply chain. In order to operate efficiently, the orderpicking process needs to be robustly designed and optimally controlled. This paper gives a literature overview on typical decision problems in design and control of manual order-picking processes. We focus on optimal (internal) layout design, storage assignment methods, routing methods, order batching and zoning. The research in this area has grown rapidly recently. Still, combinations of the above areas have hardly been explored. Order-picking system developments in practice lead to promising new research directions.Order picking;Logistics;Warehouse Management
The importance of information flows temporal attributes for the efficient scheduling of dynamic demand responsive transport services
The operation of a demand responsive transport service usually involves the management of dynamic requests. The underlying algorithms are mainly adaptations of procedures carefully designed to solve static versions of the problem, in which all the requests are known in advance. However there is no guarantee that the effectiveness of an algorithm stays unchanged when it is manipulated to work in a dynamic environment. On the other hand, the way the input is revealed to the algorithm has a decisive role on the schedule quality. We analyze three characteristics of the information flow (percentage of real-time requests, interval between call-in and requested pickup time and length of the computational cycle time), assessing their influence on the effectiveness of the scheduling proces
ANWB automates and improves repair men dispatching
ANWB, the Dutch automobile association, provides assistance, car repair andreplacement services to its nearly 4 million members. ANWB services around 1.3 millionrequests per year in The Netherlands. Historically, the operational planning process ofassigning requests to service men was regionally organized, and human planners solvedthe sometimes large and hectic planning situations in real time. At a national level, some50 planners were required to do the job, and the quality of the planning and operationswere largely unknown. In a large business process reengineering project, ANWBredesigned the planning processes, leveraging state of the art IT and operations researchtechniques. As a result, the 24/7 planning processes are smoothened, can be executed byas few as 14 planners who work at a national level, and the operational planning andperformance have improved. As new competitors entered the market, ANWB has beenable to sustain its extraordinary high customer ratings and market share, while adaptingits proposition to the competitive prices dictated by the market.Economics (Jel: A)
- âŠ