Territory planning

from Wikipedia, the free encyclopedia

Territory planning is a term from the collection of waste and recyclable materials at disposal companies . This involves the planning of collecting areas and tours.

Planning problems

This complex planning and optimization problem usually requires a great deal of planning effort. This problem is divided into three NP-severity sub-problems:

  1. Strategic planning: Determination of the number of vehicles and the occupation as service-providing units (so-called columns)
  2. Tactical planning: dividing a large planning area into smaller planning units, so-called collecting areas (see also graph partitioning )
  3. Operational planning: Creation of day tours and collective tours per day and vehicle (Capacitated Arc Routing Problem)

At the tactical level, it is a matter of dividing large planning areas (e.g. a city) in such a way that collection areas are created that can be served by a collection vehicle and its occupation in a planning horizon, taking into account the secondary conditions such as working hours and vehicle load capacity. (Collection) areas consist of a number of road sections and the containers standing on them. The effort that goes into a planning area or district is largely calculated from the number of containers and their difficulties that stand on the associated road sections. Every household container can have different removal rhythms, e.g. B. "Empty once in two weeks" (1: 2). This near- household collection process is also known as the collection process . As an alternative, there is the bring-in collection , in which the containers are not close to the household, but rather the fraction must be brought to a so-called collection island ( glass container , paper container).

This leads to the second, time-consuming, complex strategic problem with household-related collection: These collection rhythms should be distributed over the days of the week in order to provide the citizens on the street sections with a collection calendar (or garbage calendar) that shows when a container and collection rhythm is available is emptied accordingly. In operational district planning, it is now a matter of creating the actual daily collective route planning for each vehicle. This must be done in such a way that a permissible daily collection tour is created for each day in the planning horizon for each vehicle with occupants (e.g. ten daily collection tours are to be created for the planning horizon of two weeks and five working days per week).

Day collection tour

A day collection tour consists of the following phases:

  • Starts i. A. on a depot (Depot), providing the vehicle: set-up time
  • Director's drive from the depot to the first service point
  • Service trip (emptying the container)
  • Empty trips between service trips
  • Directed trips from the last service trip to the facilities (disposal facility, ...) to empty the vehicle and release the vehicle's collection capacity
  • Directed trip, if there is working time, to the next collective trip or directed trip back to the depot

Problem class

When examining the problem, two specific combinatorial problems arise: 1. The assignment of the collection rhythms of the containers and thus the road sections to be served on days (problem of periodicity) and 2. the determination of an operating sequence for the containers at the road sections (routing problem). Solving these two problems at the same time is called a one-step process. The problem class of periodic, edge-based route planning with consideration of the system trips is defined in the problem class P-MCARP-IF (Periodic Mixed Capacitated Arc Routing Problem with Intermediate Facilities).

literature

  • V. Engels: Planning heuristics for periodic, edge-based collection problems in disposal logistics . Dr. Hut Verlag, Munich 2013. ISBN 978-3-8439-0848-1
  • Uta Deffke: Intelligently collected . In: Recycling Magazin, No. 10, 2011, p. 28 ff.

Web links

Individual evidence

  1. http://www.srhh.de/srhh/opencms/privatkunden/abfuhrkalender/