Scilit logo
  • Rankings
  • Search Publications
    Cited-by Search
  • Sources
  • Publishers
  • Scholars
    Top Cited Scholars
  • Organizations
  • Scilit
    About Us
    Advisory Board
    Data Sources
    Career
    Support / Contact
    User Guide
    Publisher User
    Search Function
    Rankings Function
    API Resource
    Scilit Knowledge
    Metrics
    Scilit Recognitions
    Publications Classification
    Media
    News
    Blog
Register
  1. Home
  2. Publications
  3. Comparing Two Heuristic Local Search Algorithms for a Complex Routing Problem
  1. Home
  2. Publications
  3. Comparing Two Heuristic Local Search Algorithms for a Complex Routing Problem

Comparing Two Heuristic Local Search Algorithms for a Complex Routing Problem

Authors:
  • PCPablo Cabrera-Guerrero
    Pablo Cabrera-Guerrero
  • AMAndrés Moltedo-Perfetti
    Andrés Moltedo-Perfetti
  • ECEnrique Cabrera
    Enrique Cabrera
  • FPFernando Paredes
    Fernando Paredes

Publisher website
Google Scholar
  • 15 December 2016
    • journal article
    • Published by ICI Bucharest in Studies in Informatics and Control
    • Vol. 25  (4)
    • DOI:10.24846/v25i4y201602
Abstract
No abstract available
Cited by 3 articles
Scilit logo

Have questions? Email us at support@scilit.com

© 2026 MDPI (Basel, Switzerland) unless otherwise stated.

MDPI initiatives

  • MDPI Journals
  • MDPI Books
  • Sciforum
  • Proceedings Series
  • Preprints.org
  • SciProfiles
  • Encyclopedia
  • JAMS

Legal

  • Privacy
  • Terms
  • About
  • Contact
  • Disclaimer

Follow us

  • facebook icon
  • x icon
  • linkedin icon

Join us

  • Career

© 2026 MDPI (Basel, Switzerland) unless otherwise stated.