The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results

Pedersen, Christian Roed; Nielsen, Lars Relund; Andersen, Kim Allan

doi:10.1287/ijoc.1070.0253

Cited by 11 publications

(4 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…And, it is NP-hard since the min-max regret assignment problem, as a special case of the assignment problem, is known to be NP-hard [47]. As one of the most-studied, well-known, and important problems of discrete optimization, the assignment problem has been well studied, and many algorithms have been designed to solve it, including single-objective and multiobjective cases [48][49][50].…”

Section: Solution Algorithmmentioning

confidence: 99%

Prospect Theory-Based Two-Sided Satisfied and Stable Matching Mechanism for the Shared Parking Slots Problem

Xiao

Wang

2022

Journal of Advanced Transportation

View full text Add to dashboard Cite

The contradiction between the dramatic increase in the aggregate number of automobiles and the short supply of parking spaces leads to parking difficulties. Sharing mode helps improve the efficiency of existing parking spaces, increase resource utilization, and alleviate the difficulty of parking. This paper focuses on the matching mechanism in the shared parking slots problem, which involves three agents: shared parking suppliers, shared parking demanders, and shared parking platform. We propose a prospect theory-based two-sided satisfied and stable matching model (PT-TSSM) with two objectives to maximize the satisfaction degree of both shared parking demanders and shared parking suppliers. Numerical experiments are illustrated to demonstrate the efficiency of the proposed model. Moreover, the PT-TSSM model is compared with the other two shared parking mechanisms. The proposed model considers the satisfaction degrees of both shared parking demanders and suppliers, while first book first serve (FBFS) cares only one side of the participants. And compared with deferred acceptance (DA), our model not only takes two-sided stable matching into account but also considers the satisfaction degree of all the demand and supply participants, which obtain a two-sided satisfied and stable matching scheme.

show abstract

Section: Solution Algorithmmentioning

confidence: 99%

Prospect Theory-Based Two-Sided Satisfied and Stable Matching Mechanism for the Shared Parking Slots Problem

Xiao

Wang

2022

Journal of Advanced Transportation

View full text Add to dashboard Cite

show abstract

“…If all objective functions map to the same set S, then we simply write S p . Surprisingly little research has been devoted to branch-and-bound algorithms for general BOCO problems although many problems can be fitted into this framework, for example the bi-objective knapsack problem (Ulungu and Teghem 1997), the bi-objective assignment problem (Przybylski et al 2008, Pedersen et al 2008, bi-objective facility location problems (Fernandez and Puerto 2003), and the bi-objective TSP (Bérubé et al 2009).…”

Section: Introductionmentioning

confidence: 99%

Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets

Gadegaard

Nielsen

Ehrgott

2019

INFORMS Journal on Computing

Self Cite

View full text Add to dashboard Cite

Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print or online or to submit the papers to another publication.

show abstract

“…This fact was also observed under time-adaptive route choice [9] and is a general feature for discrete bicriterion optimization problems, see e.g. [13].…”

Section: Resultsmentioning

confidence: 52%

“…These extreme points define a number of triangles in which unsupported nondominated points may be found in phase two. For a description of a generic two-phase method see [13].…”

Section: Solution Methodsmentioning

confidence: 99%

Bicriterion Shortest Paths in Stochastic Time-Dependent Networks

Nielsen

Pretolani

Andersen

Multiobjective Programming and Goal Programming

Self Cite

View full text Add to dashboard Cite

In recent years there has been a growing interest in using stochastic time-dependent (STD) networks as a modelling tool for a number of applications within such areas as transportation and telecommunications. It is known that an optimal routing policy does not necessarily correspond to a path, but rather to a time-adaptive strategy. In some applications, however, it makes good sense to require that the routing policy should correspond to a loopless path in the network, that is, the time-adaptive aspect disappears and a priori route choice is considered.In this paper we consider bicriterion a priori route choice in STD networks, i.e. the problem of finding the set of efficient paths. Both expectation and min-max criteria are considered and a solution method based on the two-phase method is devised. Experimental results reveal that the full set of efficient solutions can be determined on rather large test instances, which is in contrast to the time-adaptive case.

show abstract

The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results

Cited by 11 publications

References 14 publications

Prospect Theory-Based Two-Sided Satisfied and Stable Matching Mechanism for the Shared Parking Slots Problem

Prospect Theory-Based Two-Sided Satisfied and Stable Matching Mechanism for the Shared Parking Slots Problem

Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets

Bicriterion Shortest Paths in Stochastic Time-Dependent Networks

Contact Info

Product

Resources

About