<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-06-02T03:52:54Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/36568" metadataPrefix="rdf">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/36568</identifier><datestamp>2026-02-03T11:24:04Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37953</setSpec></header><metadata><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:ds="http://dspace.org/ds/elements/1.1/" xmlns:ow="http://www.ontoweb.org/ontology/1#" xmlns:rdf="http://www.openarchives.org/OAI/2.0/rdf/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/rdf/ http://www.openarchives.org/OAI/2.0/rdf.xsd">
   <ow:Publication rdf:about="oai:riuma.uma.es:10630/36568">
      <dc:title>Optimizing a bi-objective vehicle routing problem that appears in industrial enterprises</dc:title>
      <dc:creator>López-Sánchez, Ana D.</dc:creator>
      <dc:creator>Molina-Luque, Julián</dc:creator>
      <dc:creator>Laguna, Manuel</dc:creator>
      <dc:creator>Hernández-Díaz, Alfredo G.</dc:creator>
      <dc:subject>Vehículos</dc:subject>
      <dc:subject>Optimización de las trayectorias</dc:subject>
      <dc:description>In this paper, a new solution method is implemented to solve a bi-&#xd;
objective variant of the Vehicle Routing Problem that appears in industry&#xd;
and environmental enterprises. The solution involves designing a set of&#xd;
routes for each day in a period, in which the service frequency is a decision&#xd;
variable. The proposed algorithm, the Muti-Start Multi-objective Local&#xd;
Search algorithm (MSMLS), minimizes total emissions produced by all ve-&#xd;
hicles and maximizes the service quality measured as the number of times&#xd;
that a customer is visited by a vehicle in order to be served. The MSMLS&#xd;
is a neighborhood-based metaheuristic that obtains high-quality solutions&#xd;
and that is capable of achieving better performance than other competi-&#xd;
tive algorithms. Furthermore, the proposed algorithm is able to perform&#xd;
rapid movements thanks to the easy representation of the solutions.</dc:description>
      <dc:date>2025-01-20T12:02:19Z</dc:date>
      <dc:date>2025-01-20T12:02:19Z</dc:date>
      <dc:date>2021</dc:date>
      <dc:type>journal article</dc:type>
      <dc:identifier>López-Sánchez, A.D.; Molina, J.; Laguna, M.; Hernández-Díaz, A.G. (2021). Optimizing a bi-objective vehicle routing problem that appears in industrial enterprises. Expert Systems. 2021, 38 (1)</dc:identifier>
      <dc:identifier>https://hdl.handle.net/10630/36568</dc:identifier>
      <dc:identifier>10.1111/exsy.12638</dc:identifier>
      <dc:language>eng</dc:language>
      <dc:rights>open access</dc:rights>
      <dc:publisher>Wiley Online Library</dc:publisher>
   </ow:Publication>
</rdf:RDF>
</metadata></record></GetRecord></OAI-PMH>