<?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-05-28T19:55:58Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/36568" metadataPrefix="marc">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><record xmlns="http://www.loc.gov/MARC21/slim" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd">
   <leader>00925njm 22002777a 4500</leader>
   <datafield ind2=" " ind1=" " tag="042">
      <subfield code="a">dc</subfield>
   </datafield>
   <datafield ind2=" " ind1=" " tag="720">
      <subfield code="a">López-Sánchez, Ana D.</subfield>
      <subfield code="e">author</subfield>
   </datafield>
   <datafield ind2=" " ind1=" " tag="720">
      <subfield code="a">Molina-Luque, Julián</subfield>
      <subfield code="e">author</subfield>
   </datafield>
   <datafield ind2=" " ind1=" " tag="720">
      <subfield code="a">Laguna, Manuel</subfield>
      <subfield code="e">author</subfield>
   </datafield>
   <datafield ind2=" " ind1=" " tag="720">
      <subfield code="a">Hernández-Díaz, Alfredo G.</subfield>
      <subfield code="e">author</subfield>
   </datafield>
   <datafield ind2=" " ind1=" " tag="260">
      <subfield code="c">2021</subfield>
   </datafield>
   <datafield ind2=" " ind1=" " tag="520">
      <subfield code="a">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.</subfield>
   </datafield>
   <datafield ind1="8" ind2=" " tag="024">
      <subfield code="a">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)</subfield>
   </datafield>
   <datafield ind1="8" ind2=" " tag="024">
      <subfield code="a">https://hdl.handle.net/10630/36568</subfield>
   </datafield>
   <datafield ind1="8" ind2=" " tag="024">
      <subfield code="a">10.1111/exsy.12638</subfield>
   </datafield>
   <datafield tag="653" ind2=" " ind1=" ">
      <subfield code="a">Vehículos</subfield>
   </datafield>
   <datafield tag="653" ind2=" " ind1=" ">
      <subfield code="a">Optimización de las trayectorias</subfield>
   </datafield>
   <datafield ind2="0" ind1="0" tag="245">
      <subfield code="a">Optimizing a bi-objective vehicle routing problem that appears in industrial enterprises</subfield>
   </datafield>
</record>
</metadata></record></GetRecord></OAI-PMH>