IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v44y2022i5d10.1007_s10878-022-00909-3.html
   My bibliography  Save this article

Computing a consensus trajectory in a vehicular network

Author

Listed:
  • Peng Zou

    (Montana State University)

  • Letu Qingge

    (North Carolina A &T State University)

  • Qing Yang

    (University of North Texas)

  • Binhai Zhu

    (Montana State University)

Abstract

In this paper, we study the problem of computing a consensus trajectory of a vehicle given the history of Points of Interest visited by the vehicle over a certain period of time. The problem arises when a system tries to establish the social connection between two vehicles in a vehicular network, where three versions of the problem are studied. Formally, given a set of m trajectories, the first version of the problem is to compute a target (median) sequence T over $$\varSigma $$ Σ such that the sum of similarity measure (i.e., number of adjacencies) between T and all $$S_i$$ S i ’s is maximized. For this version, we show that the problem is NP-hard and we present a simple factor-2 approximation based on a greedy method. We implement the greedy algorithm and a variation of it which is based on a more natural greedy search on a new data structure called adjacency map. In the second version of the problem where the sequence T is restricted to be a permutation, we show that the problem remains NP-hard but the approximation factor can be improved to 1.5. In the third version where the sequence T has to contain all letters of $$\varSigma $$ Σ , we again prove that it is NP-hard. We implement a simple greedy algorithm and a variation of the 1.5-approximation algorithm for the second version, and which are used to construct solution for the third version. Our algorithms are tested on the simulation data and the empirical results are very promising.

Suggested Citation

  • Peng Zou & Letu Qingge & Qing Yang & Binhai Zhu, 2022. "Computing a consensus trajectory in a vehicular network," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3575-3594, December.
    • Handle: RePEc:spr:jcomop:v:44:y:2022:i:5:d:10.1007_s10878-022-00909-3
    DOI: 10.1007/s10878-022-00909-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-022-00909-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-022-00909-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Chunlin Xin & Letu Qingge & Jiamin Wang & Binhai Zhu, 2015. "Robust optimization for the hazardous materials transportation network design problem," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 320-334, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    2. Zohreh Hosseini Nodeh & Ali Babapour Azar & Rashed Khanjani Shiraz & Salman Khodayifar & Panos M. Pardalos, 2020. "Joint chance constrained shortest path problem with Copula theory," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 110-140, July.
    3. M. Hosein Zare & Osman Y. Özaltın & Oleg A. Prokopyev, 2018. "On a class of bilevel linear mixed-integer programs in adversarial settings," Journal of Global Optimization, Springer, vol. 71(1), pages 91-113, May.
    4. Yan Sun & Xinya Li & Xia Liang & Cevin Zhang, 2019. "A Bi-Objective Fuzzy Credibilistic Chance-Constrained Programming Approach for the Hazardous Materials Road-Rail Multimodal Routing Problem under Uncertainty and Sustainability," Sustainability, MDPI, vol. 11(9), pages 1-27, May.
    5. Mohammadi, Mehrdad & Jula, Payman & Tavakkoli-Moghaddam, Reza, 2017. "Design of a reliable multi-modal multi-commodity model for hazardous materials transportation under uncertainty," European Journal of Operational Research, Elsevier, vol. 257(3), pages 792-809.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:44:y:2022:i:5:d:10.1007_s10878-022-00909-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.