Using goal programming on estimated Pareto fronts to solve multiobjective problems

QR Code

Using goal programming on estimated Pareto fronts to solve multiobjective problems

Modern multiobjective algorithms can be computationally inefficient in producing good approximation sets for highly constrained many-objective problems. Such problems are common in real-world applications where decision-makers need to assess multiple conflicting objectives. Also, different instances...

Full description

Bibliographic Details
Main Authors:	Pinheiro, Rodrigo Lankaites, Landa-Silva, Dario, Laesanklang, Wasakorn, Constantino, Ademir Aparecido
Format:	Conference or Workshop Item
Published:	2018
Online Access:	https://eprints.nottingham.ac.uk/48610/

Similar Items

An efficient application of goal programming to tackle multiobjective problems with recurring fitness landscapes
by: Pinheiro, Rodrigo Lankaites, et al.
Published: (2018)

Extended decomposition for mixed integer programming to solve a workforce scheduling and routing problem
by: Laesanklang, Wasakorn, et al.
Published: (2015)

Towards an efficient API for optimisation problems data
by: Pinheiro, Rodrigo Lankaites, et al.
Published: (2016)

Towards an efficient API for optimisation problems data
by: Pinheiro, Rodrigo Lankaites, et al.
Published: (2016)

An application programming interface with increased performance for optimisation problems data
by: Pinheiro, Rodrigo Lankaites, et al.
Published: (2016)

Analysis of objectives relationships in multiobjective problems using trade-off region maps
by: Pinheiro, Rodrigo L., et al.
Published: (2015)

A Variable Neighbourhood Search for nurse scheduling with balanced preference satisfaction
by: Constantino, Ademir Aparecido, et al.
Published: (2015)

An evolutionary algorithm for graph planarisation by vertex deletion
by: Pinheiro, Rodrigo Lankaites, et al.
Published: (2014)

Iterated heuristic algorithms for the classroom assignment problem
by: Constantino, Ademir Aparecido, et al.
Published: (2010)

Mixed integer programming with decomposition to solve a workforce scheduling and routing problem
by: Laesanklang, Wasakorn, et al.
Published: (2015)

A variable neighbourhood search for the workforce scheduling and routing problem
by: Pinheiro, Rodrigo Lankaites, et al.
Published: (2015)

A Genetic Algorithm for a Workforce Scheduling and Routing Problem
by: Algethami, Haneen, et al.
Published: (2016)

A technique based on trade-off maps to visualise and analyse relationships between objectives in optimisation problems
by: Pinheiro, Rodrigo Lankaites, et al.
Published: (2017)

A development and integration framework for optimisation-based enterprise solutions
by: Pinheiro, Rodrigo Lankaites, et al.
Published: (2014)

Metaheuristic and Multiobjective Approaches for Space Allocation
by: Landa Silva, Jesus Dario
Published: (2003)

Decomposition techniques with mixed integer programming and heuristics for home healthcare planning
by: Laesanklang, Wasakorn, et al.
Published: (2017)

Post-Pareto Analysis for multiobjective parabolic control systems
by: Bonnel, Henri
Published: (2013)

Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows
by: Curtois, Timothy, et al.
Published: (2018)

A computational study and heuristic algorithms for the home healthcare scheduling and routing problem
by: Pinheiro, Rodrigo Lankaites
Published: (2017)

Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm
by: Constantino, Ademir Aparecido, et al.
Published: (2017)

Evolutionary local search for solving the office space allocation problem
by: Ulker, Ozgur, et al.
Published: (2012)

Lookahead policy and genetic algorithm for solving nurse rostering problems
by: Shi, Peng, et al.
Published: (2018)

An investigation of heuristic decomposition to tackle workforce scheduling and routing with time-dependent activities constraints
by: Laesanklang, Wasakorn, et al.
Published: (2016)

Mixed integer programming with decomposition for workforce scheduling and routing with time-dependent activities constraints
by: Laesanklang, Wasakorn, et al.
Published: (2016)

An investigation of heuristic decomposition to tackle workforce scheduling and routing with time-dependent activities constraints
by: Laesanklang, Wasakorn, et al.
Published: (2017)

Heuristic decomposition and mathematical programming for workforce scheduling and routing problems
by: Laesanklang, Wasakorn
Published: (2017)

Approximate dynamic programming with combined policy functions for solving multi-stage nurse rostering problem
by: Shi, Peng, et al.
Published: (2017)

Towards collaborative optimisation in a shared-logistics environment for pickup and delivery operations
by: Curtois, Timothy, et al.
Published: (2017)

Adaptive multiple crossover genetic algorithm to solve Workforce Scheduling and Routing Problem
by: Algethami, Haneen, et al.
Published: (2018)

A heuristic algorithm for nurse scheduling with balanced preference satisfaction
by: Constantino, Ademir A., et al.
Published: (2011)

An evolutionary non-Linear great deluge approach for solving course timetabling problems
by: Obit, Joe Henry, et al.
Published: (2012)

A heuristic algorithm based on multiassignment procedures for nurse scheduling
by: Constantino, Ademir Aparecido, et al.
Published: (2014)

Vector Evaluated Gravitational Search Algorithm Assisted by Non-dominated Solutions in Solving Multiobjective Optimization Problems
by: Badaruddin, Muhammad, et al.
Published: (2016)

Multiobjective problems with fuzzy parameters and games against nature
by: Larbani, Moussa
Published: (2010)

A study of genetic operators for the Workforce Scheduling and Routing Problem
by: Algethami, Haneen, et al.
Published: (2015)

Designing difficult office space allocation problem instances with mathematical programming
by: Ulker, Ozgur, et al.
Published: (2011)

A 0/1 integer programming model for the office space allocation problem
by: Ulker, Ozgr, et al.
Published: (2010)

Diversity-based adaptive genetic algorithm for a workforce scheduling and routing problem
by: Algethami, Haneen, et al.
Published: (2017)

Beam Search Approach for the Multiobjective Flow-shop Scheduling Problem
by: Kanesan , Muthusamy, et al.
Published: (2000)

Multiple tabu search for multiobjective urban transit scheduling problem
by: Uvaraja, Vikneswary, et al.
Published: (2019)