Online heuristic for the Multi-Objective Generalized traveling salesman problem

Today's manufacturing systems are typically complex cyber-physical systems where the physical and control aspects interact with the scheduling decisions. Optimizing such facilities requires ordering jobs and configuring the manufacturing system for each job. This optimization problem can be des...

Full description

Saved in:
Bibliographic Details
Main Authors: van Pinxten, Joost, Geilen, Marc, Basten, Twan, Waqas, Umar, Somers, Lou
Format: Conference Proceeding
Language:English
Subjects:
Aerospace electronics
Conferences
Electronics
Exhibitions
Heuristic
Heuristic algorithms
Memetics
Online
Optimization
Printers
Tradeoffs
Traveling salesman problem
Traveling salesman problems
Urban areas
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Today's manufacturing systems are typically complex cyber-physical systems where the physical and control aspects interact with the scheduling decisions. Optimizing such facilities requires ordering jobs and configuring the manufacturing system for each job. This optimization problem can be described as a Multi-Objective Generalized TSP where conflicting objectives lead to a trade-off space. This is the first work to address this TSP variant, introducing a compositional heuristic suitable to online application.
ISSN:1558-1101