Publication

Mehrjahresprogramme im Strassenbau

1982
Conference Papers

Abstract

The department for road construction of the canton Aargau periodically prepares construction programs dor several years used in form of rolling schedules. These programs should comply with financial restrictions, tend to use the full annual ressources, produce a big construction volume , taking into account the given priorities of the projects and respecting their earliest dates. As an auxiliary tool a computer program was developed to efficiently produce good solutions for this multiple ressources constrained scheduling problem. Therein the method of Lagrange duality was used together with heuristic rules to control a Branch and Bound and a Greedy algorithm.

Official source

https://infoscience.epfl.ch/entities/publication/72c949ce-59f4-4b8c-a855-34281f25a874

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

1982
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/72c949ce-59f4-4b8c-a855-34281f25a874

About this result

Related concepts (25)

Heuristic

A heuristic (hjʊˈrɪstɪk; ), or heuristic technique, is any approach to problem solving or self-discovery that employs a practical method that is not guaranteed to be optimal, perfect, or rational, but is nevertheless sufficient for reaching an immediate, short-term goal or approximation. Where finding an optimal solution is impossible or impractical, heuristic methods can be used to speed up the process of finding a satisfactory solution. Heuristics can be mental shortcuts that ease the cognitive load of making a decision.

Heuristic (computer science)

In mathematical optimization and computer science, heuristic (from Greek εὑρίσκω "I find, discover") is a technique designed for problem solving more quickly when classic methods are too slow for finding an exact or approximate solution, or when classic methods fail to find any exact solution. This is achieved by trading optimality, completeness, accuracy, or precision for speed. In a way, it can be considered a shortcut.

Greedy algorithm

A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage. In many problems, a greedy strategy does not produce an optimal solution, but a greedy heuristic can yield locally optimal solutions that approximate a globally optimal solution in a reasonable amount of time. For example, a greedy strategy for the travelling salesman problem (which is of high computational complexity) is the following heuristic: "At each step of the journey, visit the nearest unvisited city.

Related publications (4)

Mehrjahresprogramme im Strassenbau

Chat with Graph Search

Network design of a transport system based on accelerating moving walkways

Inversion Minimization in Majority-Inverter Graphs

Fault-tolerant and transactional mobile agent execution