Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

A geometric branch-and-bound algorithm for the service bundle design problem

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
اقرأ أكثر حفظ في قائمتي
  • المؤلفون: Li, Yifu; Qi, Xiangtong
  • نوع التسجيلة:
    Electronic Resource
  • الدخول الالكتروني :
    http://repository.ust.hk/ir/Record/1783.1-117562
    http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=0377-2217&rft.volume=&rft.issue=&rft.date=2022&rft.spage=&rft.aulast=Li&rft.aufirst=&rft.atitle=A+geometric+branch-and-bound+algorithm+for+the+service+bundle+design+problem&rft.title=European+Journal+of+Operational+Research
    http://www.scopus.com/record/display.url?eid=2-s2.0-85128339522&origin=inward
  • معلومة اضافية
    • Publisher Information:
      Elsevier B.V. 2022
    • نبذة مختصرة :
      In the service industry, a service provider may sell a collection of service activities as a package, also known as a service bundle. Empirical studies indicate that the customer's ex-post perception of a service bundle depends on not only the utility of each activity, but also the sequence of the activities being delivered. The latter can be measured by certain sequence effects, such as the utility of the peak activity, the utility of the end activity, and the trend of utility change over the activities. This phenomenon gives a service provider an opportunity to optimize a service bundle by manipulating the activities and their sequence. Such a service bundle design problem can be formulated as a 0–1 sum-of-ratios problem. To solve the problem, we design a novel geometric branch-and-bound algorithm. The algorithm divides the objective function into several dimensions, and repeatedly strengthens the bounds of each dimension. This enables us to convert the 0–1 sum-of-ratios problem into a series of 0–1 quadratic optimization problems. Computational experiments show that the algorithm can solve the service bundle design problem efficiently.
    • الموضوع:
      0–1 Sum-of-ratios problem; Geometric branch-and-bound algorithm; Scheduling; Service design; Article
    • Availability:
      Open access content. Open access content
    • Note:
      English
    • Other Numbers:
      HNK oai:repository.hkust.edu.hk:1783.1-117562
      European Journal of Operational Research, 26 March 2022
      0377-2217
      https://doi.org/10.1016/j.ejor.2022.03.044
      1331262455
    • Contributing Source:
      HONG KONG UNIV OF SCI & TECH, THE
      From OAIster®, provided by the OCLC Cooperative.
    • الرقم المعرف:
      edsoai.on1331262455
HoldingsOnline