000065229 001__ 65229 000065229 005__ 20220208112844.0 000065229 0247_ $$2doi$$a10.1007/s11590-016-1073-x 000065229 0248_ $$2sideral$$a96269 000065229 037__ $$aART-2017-96269 000065229 041__ $$aeng 000065229 100__ $$0(orcid)0000-0001-7603-9380$$aCalvete, Herminia I.$$uUniversidad de Zaragoza 000065229 245__ $$aThe energy-constrained quickest path problem 000065229 260__ $$c2017 000065229 5060_ $$aAccess copy available to the general public$$fUnrestricted 000065229 5203_ $$aThis paper addresses a variant of the quickest path problem in which each arc has an additional parameter associated to it representing the energy consumed during the transmission along the arc while each node is endowed with a limited power to transmit messages. The aim of the energy-constrained quickest path problem is to obtain a quickest path whose nodes are able to support the transmission of a message of a known size. After introducing the problem and proving the main theoretical results, a polynomial algorithm is proposed to solve the problem based on computing shortest paths in a sequence of subnetworks of the original network. In the second part of the paper, the bi-objective variant of this problem is considered in which the objectives are the transmission time and the total energy used. An exact algorithm is proposed to find a complete set of efficient paths. The computational experiments carried out show the performance of both algorithms. 000065229 536__ $$9info:eu-repo/grantAgreement/ES/DGA/E58$$9info:eu-repo/grantAgreement/ES/UZ/FPUZ-2012-CIE-07 000065229 540__ $$9info:eu-repo/semantics/openAccess$$aAll rights reserved$$uhttp://www.europeana.eu/rights/rr-f/ 000065229 590__ $$a1.013$$b2017 000065229 591__ $$aMATHEMATICS, APPLIED$$b119 / 252 = 0.472$$c2017$$dQ2$$eT2 000065229 591__ $$aOPERATIONS RESEARCH & MANAGEMENT SCIENCE$$b65 / 83 = 0.783$$c2017$$dQ4$$eT3 000065229 592__ $$a0.721$$b2017 000065229 593__ $$aControl and Optimization$$c2017$$dQ2 000065229 655_4 $$ainfo:eu-repo/semantics/article$$vinfo:eu-repo/semantics/acceptedVersion 000065229 700__ $$0(orcid)0000-0001-8686-3963$$aPozo, Lourdes del$$uUniversidad de Zaragoza 000065229 700__ $$0(orcid)0000-0001-9993-9816$$aIranzo, José A.$$uUniversidad de Zaragoza 000065229 7102_ $$12007$$2265$$aUniversidad de Zaragoza$$bDpto. Métodos Estadísticos$$cÁrea Estadís. Investig. Opera. 000065229 773__ $$g11, 7 (2017), 1319-1339$$pOptimization Letters$$tOptimization Letters$$x1862-4472 000065229 8564_ $$s374268$$uhttps://zaguan.unizar.es/record/65229/files/texto_completo.pdf$$yPostprint 000065229 8564_ $$s50719$$uhttps://zaguan.unizar.es/record/65229/files/texto_completo.jpg?subformat=icon$$xicon$$yPostprint 000065229 909CO $$ooai:zaguan.unizar.es:65229$$particulos$$pdriver 000065229 951__ $$a2022-02-08-11:23:18 000065229 980__ $$aARTICLE