Zur Hauptnavigation / To main navigation

Zur Sekundärnavigation / To secondary navigation

Zum Inhalt dieser Seite / To the content of this page

Sekundärnavigation / Secondary navigation

Inhaltsbereich / Content

Technical Report - An adaptive large neighborhood search with path relinking for a class of vehicle-routing problems with simultaneous pickup and delivery

now available for download

Abstract

We study a class of vehicle-routing problems (VRP) with simultaneous pickup and delivery (VRPSPD). In VRPSPDs, each customer may require a certain quantity of goods delivered from the depot and a quantity of goods to be picked up and returned to the depot. Besides the standard VRPSPD, we address (i) the VRPSPD with time limit (VRPSPDTL), which imposes a time limit on the routes of the transportation vehicles, (ii) the VRPSPD with time windows (VRPSPDTW), which takes customer time windows into account, (iii) the VRP with divisible deliveries and pickups (VRPDDP), which allows for ful lling the delivery and pickup requests of each customer in two separate visits, and (iv) the previously unstudied VRPDDP with time windows (VRPDDPTW). We develop a hybrid heuristic solution method which combines an adaptive large neighborhood search algorithm with a path relinking approach, called ALNS-PR, and we demonstrate the competitiveness of our algorithm on benchmark instances proposed in the literature.

 



Research areas and current projects

 

Our research focuses on modeling complex (and often stochastic) search and optimization problems in business, and solving them via computational heuristics. A special emphasis is given to distributed problems arising in social multi-agent systems, which cannot be optimized by pure economic price coordination.  Imposing a solution by a central planner will often be rejected by the autonomous agents. We therefore need to design distributed mechanisms providing incentives to participate to the individual agents without deviating too much from a pareto-efficient solution.


We apply these methods to various domains, leading the following complementary areas of research::

  • Computational Intelligence
  • Vehicle Routing
  • Yield Management and Planning of Internal Processes
  • Multi-Agent Systems
  • Recommender Systems for Reciprocal Matching
  • Medical Data Mining and Forecasting

 For details please refer to "Research".

 


Courses

 

Besides our Bachelor courses "Business Information Systems" and "Operations Research" we offer the following Master courses: