EP Journals Group logo
EP Journals GroupAcademic Publishing Organisation
Submit Paper
HomeAboutJournalsArticlesIndexingAuthor GuidelinesPublication ProcessEditorial BoardPoliciesContact

Global Journal of Engineering and Technology Research (GJETR) · Research article · Open access

Branch-And-Cut and a Sequential Heuristic for Multimodal Multi-Demand Routing

KONE Oumar, EDI Y. F. Aristide, EDI K. Hilaire, TAKOUDA P. L. Matthias

29 August 2026 · Vol. 2, Issue 8, pp. 366-373

DOI: 10.65150/EP-gjetr/V2E8/2026-06

Download full text (PDF)Cite this article

What is this article about?

We study multimodal multi-demand routing with coupled capacities on a formal/informal urban network, modeled by the compact MILP Pext. We compare two complementary solution paradigms—an exact branch-and-cut algorithm (BAC) and a greedy sequential construction heuristic (SEQ)—in a scalability study on 1000 instances (20 groups × 50), measuring CPU time, primal quality relative to the certified optimum, and structural growth of the compact model.

Article at a glance

Journal
Global Journal of Engineering and Technology Research (GJETR)
Published
29 August 2026
Volume / issue / pages
Vol. 2, Issue 8, pp. 366-373
ISSN
3051-3782 (online) · 3051-3774 (print)
Licence
CC BY 4.0 — free to read and reuse with attribution
Peer review
Double-blind, at least two independent reviewers
Publisher
EP Journals Group

Abstract

We study multimodal multi-demand routing with coupled capacities on a formal/informal urban network, modeled by the compact MILP Pext. We compare two complementary solution paradigms—an exact branch-and-cut algorithm (BAC) and a greedy sequential construction heuristic (SEQ)—in a scalability study on 1000 instances (20 groups × 50), measuring CPU time, primal quality relative to the certified optimum, and structural growth of the compact model. Both methods use the same elementary-path decoder, so that the reported time–quality trade-off isolates the algorithmic paradigm rather than incidental modeling differences.

Keywords: multimodal transport, formal and informal transit, MILP, branch-and-cut, constructive heuristic, scalability, operations research

Cite this article

APA
KONE Oumar, EDI Y. F. Aristide, EDI K. Hilaire, & TAKOUDA P. L. Matthias (2026). Branch-And-Cut and a Sequential Heuristic for Multimodal Multi-Demand Routing. Global Journal of Engineering and Technology Research, 2(8), 366-373. https://doi.org/10.65150/EP-gjetr/V2E8/2026-06
BibTeX
@article{KONE2026,
  title   = {Branch-And-Cut and a Sequential Heuristic for Multimodal Multi-Demand Routing},
  author  = {KONE Oumar and EDI Y. F. Aristide and EDI K. Hilaire and TAKOUDA P. L. Matthias},
  journal = {Global Journal of Engineering and Technology Research},
  year    = {2026},
  volume  = {2},
  number  = {8},
  pages   = {366-373},
  doi     = {10.65150/EP-gjetr/V2E8/2026-06},
  url     = {https://doi.org/10.65150/EP-gjetr/V2E8/2026-06}
}

Questions about this article

Who wrote this article?

KONE Oumar, EDI Y. F. Aristide, EDI K. Hilaire, TAKOUDA P. L. Matthias.

Where and when was it published?

In Global Journal of Engineering and Technology Research, Volume 2, Issue 8, pages 366-373, published by EP Journals Group on 29 August 2026.

Is this article free to read?

Yes. It is open access under a Creative Commons Attribution 4.0 (CC BY 4.0) licence, so anyone can read, share and reuse it with attribution.

What is the DOI of this article?

10.65150/EP-gjetr/V2E8/2026-06 (https://doi.org/10.65150/EP-gjetr/V2E8/2026-06).

How do I cite this article?

APA: KONE Oumar, EDI Y. F. Aristide, EDI K. Hilaire, & TAKOUDA P. L. Matthias (2026). Branch-And-Cut and a Sequential Heuristic for Multimodal Multi-Demand Routing. Global Journal of Engineering and Technology Research, 2(8), 366-373. https://doi.org/10.65150/EP-gjetr/V2E8/2026-06

More research from GJETR

  • Optimized Deep Convolutional Networks for MRI Brain Tumor Classification and Segmentation: A Systematic Review

    Maher Talal Al-Asaady · Oct 2026

  • Industry Micro-Credential Infusion in PQF Level 5 Technology Diploma Programs: Opportunities and Challenges

    Gamaliel B. Vicente Jr., Alma O. Medio, Redjie D. Arcadio · Oct 2026

  • Assessment of Process Mapping, Risk Management, and Iso 9001 Quality Management Standards: Basis for a Technology-Enabled Quality Management Framework

    Patrick E. Arendain, Redjie D. Arcadio · Oct 2026

  • Integrating Solar-Powered PV Cells And SCR-Controlled Three-Phase Rectifiers to Design A Two-Level DC Grid Architecture

    Sadia Sultana Turna, Amzad Ali Sarkar · Oct 2026

  • Density Functional Theory Investigation of Defect-Induced Electronic Behavior in Iodine-Deficient Mapbi₃ Perovskites for Solar Cells

    Sani Kado, Muhammad Y. Onimisi, Dahiru M. Sanni · Sept 2026

← All articlesAbout GJETR and how to submit

Publisher

EP Journals Group

Publisher of peer-reviewed scholarly journals operating under a documented governance framework. Editorial decisions are based on scholarly merit and peer review, and the portfolio is published on a monthly frequency.

Country / jurisdiction: Published and administered internationally

Journals

  • Journals list (publisher site)

Policies

  • Publication Ethics
  • Peer Review Process
  • Editorial Policies
  • Corrections & Retractions
  • Open Access
  • Complete policy index

Administration

Official contact email:
editor@ep-journals.org

Administrative note: Correspondence is logged for governance and audit purposes. Editorial enquiries answered within 24 hours. Editorial decisions typically within 1–2 weeks.

Compliance disclaimer: Indexing claims and database listings are subject to verification by the respective agencies.

© 2026 EP Journals Group. All rights reserved.

AboutJournalsArticlesFor AuthorsTemplatesEditorial BoardJoin the BoardIndexingFAQSubmitPublishPoliciesEthicsPeer ReviewContact

EP Journals Group operates under a documented policy framework. Editorial decisions are independent and are grounded in peer review and scholarly assessment. All journals are peer-reviewed, open-access, and published monthly. Indexing claims are subject to verification by the respective agencies.

Last site update: April 2026